/usr/bin/java -Xmx8000000000 -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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:47:03,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:47:03,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:47:03,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:47:03,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:47:03,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:47:03,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:47:03,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:47:03,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:47:03,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:47:03,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:47:03,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:47:03,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:47:03,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:47:03,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:47:03,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:47:03,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:47:03,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:47:03,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:47:03,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:47:03,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:47:03,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:47:03,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:47:03,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:47:03,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:47:03,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:47:03,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:47:03,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:47:03,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:47:03,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:47:03,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:47:03,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:47:03,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:47:03,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:47:03,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:47:03,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:47:03,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:47:03,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:47:03,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:47:03,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:47:03,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:47:03,874 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:47:03,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:47:03,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:47:03,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:47:03,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:47:03,907 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:47:03,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:47:03,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:47:03,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:47:03,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:47:03,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:47:03,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:47:03,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:47:03,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:47:03,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:47:03,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:47:03,910 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:47:03,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:47:03,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:47:03,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:47:03,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:47:03,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:47:03,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:47:03,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:47:03,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:47:03,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:47:03,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:47:03,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:47:03,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:47:03,911 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-12-13 12:47:04,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:47:04,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:47:04,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:47:04,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:47:04,240 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:47:04,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-13 12:47:05,408 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:47:05,656 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:47:05,657 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-13 12:47:05,663 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03844b9be/bc663a04dbbb41d3b0e6ea69a7552e29/FLAG72642a0df [2022-12-13 12:47:05,685 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03844b9be/bc663a04dbbb41d3b0e6ea69a7552e29 [2022-12-13 12:47:05,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:47:05,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:47:05,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:47:05,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:47:05,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:47:05,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:47:05" (1/1) ... [2022-12-13 12:47:05,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788fb17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:05, skipping insertion in model container [2022-12-13 12:47:05,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:47:05" (1/1) ... [2022-12-13 12:47:05,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:47:05,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:47:05,923 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-13 12:47:05,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:47:05,946 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:47:05,995 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-13 12:47:05,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:47:06,015 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:47:06,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06 WrapperNode [2022-12-13 12:47:06,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:47:06,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:47:06,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:47:06,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:47:06,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,075 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-12-13 12:47:06,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:47:06,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:47:06,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:47:06,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:47:06,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,124 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:47:06,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:47:06,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:47:06,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:47:06,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (1/1) ... [2022-12-13 12:47:06,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:47:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:47:06,164 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-12-13 12:47:06,191 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-12-13 12:47:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:47:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:47:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:47:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:47:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 12:47:06,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 12:47:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 12:47:06,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 12:47:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 12:47:06,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 12:47:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:47:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:47:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:47:06,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:47:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:47:06,209 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:47:06,362 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:47:06,363 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:47:06,667 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:47:06,677 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:47:06,677 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 12:47:06,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:47:06 BoogieIcfgContainer [2022-12-13 12:47:06,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:47:06,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:47:06,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:47:06,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:47:06,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:47:05" (1/3) ... [2022-12-13 12:47:06,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69359d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:47:06, skipping insertion in model container [2022-12-13 12:47:06,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:06" (2/3) ... [2022-12-13 12:47:06,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69359d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:47:06, skipping insertion in model container [2022-12-13 12:47:06,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:47:06" (3/3) ... [2022-12-13 12:47:06,688 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-12-13 12:47:06,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:47:06,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:47:06,704 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:47:06,811 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 12:47:06,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 282 transitions, 588 flow [2022-12-13 12:47:07,028 INFO L130 PetriNetUnfolder]: 28/279 cut-off events. [2022-12-13 12:47:07,029 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:47:07,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 279 events. 28/279 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-13 12:47:07,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 282 transitions, 588 flow [2022-12-13 12:47:07,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 269 transitions, 556 flow [2022-12-13 12:47:07,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:07,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 269 transitions, 556 flow [2022-12-13 12:47:07,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 269 transitions, 556 flow [2022-12-13 12:47:07,118 INFO L130 PetriNetUnfolder]: 28/269 cut-off events. [2022-12-13 12:47:07,118 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:47:07,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 269 events. 28/269 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 367 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-13 12:47:07,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 269 transitions, 556 flow [2022-12-13 12:47:07,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 7560 [2022-12-13 12:47:16,214 INFO L241 LiptonReduction]: Total number of compositions: 230 [2022-12-13 12:47:16,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:47:16,242 INFO L357 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=REPEATED_LIPTON_PN, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@449acc4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:47:16,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 12:47:16,260 INFO L130 PetriNetUnfolder]: 11/38 cut-off events. [2022-12-13 12:47:16,261 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:47:16,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:16,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:16,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1480647140, now seen corresponding path program 1 times [2022-12-13 12:47:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:16,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614644612] [2022-12-13 12:47:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:17,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:17,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614644612] [2022-12-13 12:47:17,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614644612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:17,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:17,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020659938] [2022-12-13 12:47:17,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:17,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:17,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:17,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 12:47:17,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:17,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:17,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 12:47:17,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:17,444 INFO L130 PetriNetUnfolder]: 1171/1614 cut-off events. [2022-12-13 12:47:17,445 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-13 12:47:17,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 1614 events. 1171/1614 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6034 event pairs, 283 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 2876. Up to 593 conditions per place. [2022-12-13 12:47:17,455 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 100 selfloop transitions, 18 changer transitions 2/121 dead transitions. [2022-12-13 12:47:17,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 121 transitions, 539 flow [2022-12-13 12:47:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:47:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:47:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-13 12:47:17,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2022-12-13 12:47:17,467 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 96 flow. Second operand 7 states and 128 transitions. [2022-12-13 12:47:17,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 121 transitions, 539 flow [2022-12-13 12:47:17,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 121 transitions, 501 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 12:47:17,475 INFO L231 Difference]: Finished difference. Result has 42 places, 55 transitions, 196 flow [2022-12-13 12:47:17,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=42, PETRI_TRANSITIONS=55} [2022-12-13 12:47:17,479 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-13 12:47:17,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:17,480 INFO L89 Accepts]: Start accepts. Operand has 42 places, 55 transitions, 196 flow [2022-12-13 12:47:17,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:17,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:17,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 55 transitions, 196 flow [2022-12-13 12:47:17,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 55 transitions, 196 flow [2022-12-13 12:47:17,494 INFO L130 PetriNetUnfolder]: 30/97 cut-off events. [2022-12-13 12:47:17,494 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-12-13 12:47:17,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 97 events. 30/97 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 285 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 118. Up to 19 conditions per place. [2022-12-13 12:47:17,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 55 transitions, 196 flow [2022-12-13 12:47:17,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 12:47:17,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:17,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1052] L49-6-->thread1EXIT: Formula: (and (let ((.cse1 (= |v_thread1Thread1of1ForFork0_#res.offset_17| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res.base_17| 0)) (.cse0 (= 0 (mod v_thread1Thread1of1ForFork0_~stop~0_41 256)))) (or (and (= (+ v_~n2~0_80 v_~res1~0_58) v_~n1~0_94) .cse0 .cse1 .cse2) (and .cse1 (= v_~res1~0_59 v_~res1~0_58) .cse2 (not .cse0)))) (or (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n2~0_80)) (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n1~0_94)))) InVars {~res1~0=v_~res1~0_59, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} OutVars{~res1~0=v_~res1~0_58, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_17|, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_17|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 12:47:18,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-13 12:47:18,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-13 12:47:18,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-13 12:47:18,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-13 12:47:19,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1054] L69-6-->thread2EXIT: Formula: (and (or (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n3~0_88)) (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n2~0_84))) (let ((.cse2 (= (mod v_thread2Thread1of1ForFork1_~stop~1_33 256) 0)) (.cse0 (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) (or (and .cse0 (= (+ v_~n3~0_88 v_~res2~0_56) v_~n2~0_84) .cse1 .cse2) (and (not .cse2) (= v_~res2~0_57 v_~res2~0_56) .cse0 .cse1)))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, ~res2~0=v_~res2~0_57} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~res2~0=v_~res2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-13 12:47:19,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-13 12:47:19,495 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:47:19,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2018 [2022-12-13 12:47:19,497 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 55 transitions, 223 flow [2022-12-13 12:47:19,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:19,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:19,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:19,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:47:19,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash -404154940, now seen corresponding path program 2 times [2022-12-13 12:47:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:19,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561462312] [2022-12-13 12:47:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:19,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561462312] [2022-12-13 12:47:19,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561462312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:19,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:19,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754502698] [2022-12-13 12:47:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:19,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:19,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 12:47:19,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 55 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:19,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:19,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 12:47:19,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:20,108 INFO L130 PetriNetUnfolder]: 1281/1861 cut-off events. [2022-12-13 12:47:20,108 INFO L131 PetriNetUnfolder]: For 813/813 co-relation queries the response was YES. [2022-12-13 12:47:20,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 1861 events. 1281/1861 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7923 event pairs, 273 based on Foata normal form. 1/1698 useless extension candidates. Maximal degree in co-relation 4535. Up to 813 conditions per place. [2022-12-13 12:47:20,119 INFO L137 encePairwiseOnDemand]: 32/47 looper letters, 90 selfloop transitions, 18 changer transitions 2/111 dead transitions. [2022-12-13 12:47:20,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 111 transitions, 612 flow [2022-12-13 12:47:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:47:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:47:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-13 12:47:20,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4297872340425532 [2022-12-13 12:47:20,121 INFO L175 Difference]: Start difference. First operand has 42 places, 55 transitions, 223 flow. Second operand 5 states and 101 transitions. [2022-12-13 12:47:20,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 111 transitions, 612 flow [2022-12-13 12:47:20,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 111 transitions, 586 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 12:47:20,130 INFO L231 Difference]: Finished difference. Result has 48 places, 61 transitions, 301 flow [2022-12-13 12:47:20,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=48, PETRI_TRANSITIONS=61} [2022-12-13 12:47:20,131 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 12:47:20,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:20,131 INFO L89 Accepts]: Start accepts. Operand has 48 places, 61 transitions, 301 flow [2022-12-13 12:47:20,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:20,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:20,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 61 transitions, 301 flow [2022-12-13 12:47:20,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 61 transitions, 301 flow [2022-12-13 12:47:20,150 INFO L130 PetriNetUnfolder]: 44/170 cut-off events. [2022-12-13 12:47:20,150 INFO L131 PetriNetUnfolder]: For 85/95 co-relation queries the response was YES. [2022-12-13 12:47:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 170 events. 44/170 cut-off events. For 85/95 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 820 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 309. Up to 35 conditions per place. [2022-12-13 12:47:20,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 61 transitions, 301 flow [2022-12-13 12:47:20,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-13 12:47:20,154 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:20,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 12:47:20,155 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 61 transitions, 301 flow [2022-12-13 12:47:20,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:20,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:20,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:20,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:47:20,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1255969656, now seen corresponding path program 3 times [2022-12-13 12:47:20,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:20,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856797976] [2022-12-13 12:47:20,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:20,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856797976] [2022-12-13 12:47:20,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856797976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:20,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:20,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906483866] [2022-12-13 12:47:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:20,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:20,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 12:47:20,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 61 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:20,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:20,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 12:47:20,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:20,973 INFO L130 PetriNetUnfolder]: 1494/2210 cut-off events. [2022-12-13 12:47:20,974 INFO L131 PetriNetUnfolder]: For 2241/2241 co-relation queries the response was YES. [2022-12-13 12:47:20,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 2210 events. 1494/2210 cut-off events. For 2241/2241 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10065 event pairs, 355 based on Foata normal form. 1/2017 useless extension candidates. Maximal degree in co-relation 5952. Up to 913 conditions per place. [2022-12-13 12:47:20,987 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 97 selfloop transitions, 22 changer transitions 2/122 dead transitions. [2022-12-13 12:47:20,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 122 transitions, 757 flow [2022-12-13 12:47:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:47:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:47:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-13 12:47:20,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 12:47:20,991 INFO L175 Difference]: Start difference. First operand has 47 places, 61 transitions, 301 flow. Second operand 6 states and 117 transitions. [2022-12-13 12:47:20,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 122 transitions, 757 flow [2022-12-13 12:47:21,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 122 transitions, 716 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 12:47:21,005 INFO L231 Difference]: Finished difference. Result has 53 places, 64 transitions, 367 flow [2022-12-13 12:47:21,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=53, PETRI_TRANSITIONS=64} [2022-12-13 12:47:21,007 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-13 12:47:21,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:21,007 INFO L89 Accepts]: Start accepts. Operand has 53 places, 64 transitions, 367 flow [2022-12-13 12:47:21,009 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:21,009 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:21,009 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 64 transitions, 367 flow [2022-12-13 12:47:21,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 64 transitions, 367 flow [2022-12-13 12:47:21,030 INFO L130 PetriNetUnfolder]: 45/210 cut-off events. [2022-12-13 12:47:21,031 INFO L131 PetriNetUnfolder]: For 236/290 co-relation queries the response was YES. [2022-12-13 12:47:21,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 210 events. 45/210 cut-off events. For 236/290 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1193 event pairs, 0 based on Foata normal form. 1/184 useless extension candidates. Maximal degree in co-relation 390. Up to 35 conditions per place. [2022-12-13 12:47:21,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 64 transitions, 367 flow [2022-12-13 12:47:21,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-13 12:47:21,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:21,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:47:21,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-13 12:47:21,262 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 371 flow [2022-12-13 12:47:21,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:21,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:21,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:21,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:47:21,263 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:21,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1269268782, now seen corresponding path program 4 times [2022-12-13 12:47:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:21,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302594217] [2022-12-13 12:47:21,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:21,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:21,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302594217] [2022-12-13 12:47:21,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302594217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:21,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:21,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488916004] [2022-12-13 12:47:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:21,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:21,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-13 12:47:21,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 64 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:21,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:21,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-13 12:47:21,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:21,964 INFO L130 PetriNetUnfolder]: 1541/2281 cut-off events. [2022-12-13 12:47:21,964 INFO L131 PetriNetUnfolder]: For 2885/2885 co-relation queries the response was YES. [2022-12-13 12:47:21,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7282 conditions, 2281 events. 1541/2281 cut-off events. For 2885/2885 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10449 event pairs, 313 based on Foata normal form. 1/2097 useless extension candidates. Maximal degree in co-relation 6694. Up to 823 conditions per place. [2022-12-13 12:47:21,980 INFO L137 encePairwiseOnDemand]: 28/46 looper letters, 115 selfloop transitions, 37 changer transitions 3/156 dead transitions. [2022-12-13 12:47:21,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 156 transitions, 1050 flow [2022-12-13 12:47:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:47:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:47:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-13 12:47:21,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4409937888198758 [2022-12-13 12:47:21,983 INFO L175 Difference]: Start difference. First operand has 53 places, 64 transitions, 371 flow. Second operand 7 states and 142 transitions. [2022-12-13 12:47:21,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 156 transitions, 1050 flow [2022-12-13 12:47:21,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 156 transitions, 1022 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 12:47:22,000 INFO L231 Difference]: Finished difference. Result has 62 places, 86 transitions, 651 flow [2022-12-13 12:47:22,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=651, PETRI_PLACES=62, PETRI_TRANSITIONS=86} [2022-12-13 12:47:22,002 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2022-12-13 12:47:22,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:22,002 INFO L89 Accepts]: Start accepts. Operand has 62 places, 86 transitions, 651 flow [2022-12-13 12:47:22,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:22,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:22,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 86 transitions, 651 flow [2022-12-13 12:47:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 86 transitions, 651 flow [2022-12-13 12:47:22,029 INFO L130 PetriNetUnfolder]: 63/243 cut-off events. [2022-12-13 12:47:22,029 INFO L131 PetriNetUnfolder]: For 443/516 co-relation queries the response was YES. [2022-12-13 12:47:22,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 243 events. 63/243 cut-off events. For 443/516 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1387 event pairs, 0 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 594. Up to 45 conditions per place. [2022-12-13 12:47:22,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 86 transitions, 651 flow [2022-12-13 12:47:22,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 898 [2022-12-13 12:47:22,036 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:22,044 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 12:47:22,044 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 86 transitions, 651 flow [2022-12-13 12:47:22,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:22,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:22,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:22,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:47:22,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash -726260692, now seen corresponding path program 5 times [2022-12-13 12:47:22,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:22,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236461615] [2022-12-13 12:47:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:22,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:22,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:22,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236461615] [2022-12-13 12:47:22,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236461615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:22,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:22,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119460336] [2022-12-13 12:47:22,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:22,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:22,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 12:47:22,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 86 transitions, 651 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:22,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:22,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 12:47:22,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:22,841 INFO L130 PetriNetUnfolder]: 1631/2432 cut-off events. [2022-12-13 12:47:22,842 INFO L131 PetriNetUnfolder]: For 5786/5786 co-relation queries the response was YES. [2022-12-13 12:47:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8962 conditions, 2432 events. 1631/2432 cut-off events. For 5786/5786 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11403 event pairs, 305 based on Foata normal form. 1/2333 useless extension candidates. Maximal degree in co-relation 8133. Up to 1369 conditions per place. [2022-12-13 12:47:22,881 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 129 selfloop transitions, 33 changer transitions 2/165 dead transitions. [2022-12-13 12:47:22,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 165 transitions, 1319 flow [2022-12-13 12:47:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:47:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:47:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-13 12:47:22,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 12:47:22,883 INFO L175 Difference]: Start difference. First operand has 61 places, 86 transitions, 651 flow. Second operand 6 states and 126 transitions. [2022-12-13 12:47:22,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 165 transitions, 1319 flow [2022-12-13 12:47:22,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 165 transitions, 1255 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-13 12:47:22,917 INFO L231 Difference]: Finished difference. Result has 68 places, 100 transitions, 837 flow [2022-12-13 12:47:22,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=837, PETRI_PLACES=68, PETRI_TRANSITIONS=100} [2022-12-13 12:47:22,922 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-13 12:47:22,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:22,922 INFO L89 Accepts]: Start accepts. Operand has 68 places, 100 transitions, 837 flow [2022-12-13 12:47:22,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:22,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:22,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 100 transitions, 837 flow [2022-12-13 12:47:22,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 100 transitions, 837 flow [2022-12-13 12:47:22,957 INFO L130 PetriNetUnfolder]: 80/311 cut-off events. [2022-12-13 12:47:22,957 INFO L131 PetriNetUnfolder]: For 698/752 co-relation queries the response was YES. [2022-12-13 12:47:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 311 events. 80/311 cut-off events. For 698/752 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1971 event pairs, 0 based on Foata normal form. 10/289 useless extension candidates. Maximal degree in co-relation 817. Up to 52 conditions per place. [2022-12-13 12:47:22,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 100 transitions, 837 flow [2022-12-13 12:47:22,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-13 12:47:22,963 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:22,964 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 12:47:22,964 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 100 transitions, 837 flow [2022-12-13 12:47:22,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:22,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:22,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:22,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:47:22,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -810105417, now seen corresponding path program 1 times [2022-12-13 12:47:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:22,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457034097] [2022-12-13 12:47:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457034097] [2022-12-13 12:47:23,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457034097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:23,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:23,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333383426] [2022-12-13 12:47:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:23,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:23,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 12:47:23,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 837 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:23,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:23,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 12:47:23,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:23,709 INFO L130 PetriNetUnfolder]: 1669/2512 cut-off events. [2022-12-13 12:47:23,710 INFO L131 PetriNetUnfolder]: For 6382/6382 co-relation queries the response was YES. [2022-12-13 12:47:23,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 2512 events. 1669/2512 cut-off events. For 6382/6382 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12137 event pairs, 269 based on Foata normal form. 1/2415 useless extension candidates. Maximal degree in co-relation 9297. Up to 821 conditions per place. [2022-12-13 12:47:23,736 INFO L137 encePairwiseOnDemand]: 29/45 looper letters, 144 selfloop transitions, 40 changer transitions 8/193 dead transitions. [2022-12-13 12:47:23,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 193 transitions, 1666 flow [2022-12-13 12:47:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:47:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:47:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-13 12:47:23,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2022-12-13 12:47:23,737 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 837 flow. Second operand 7 states and 142 transitions. [2022-12-13 12:47:23,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 193 transitions, 1666 flow [2022-12-13 12:47:23,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 193 transitions, 1646 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 12:47:23,758 INFO L231 Difference]: Finished difference. Result has 75 places, 111 transitions, 1028 flow [2022-12-13 12:47:23,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1028, PETRI_PLACES=75, PETRI_TRANSITIONS=111} [2022-12-13 12:47:23,761 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-13 12:47:23,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:23,761 INFO L89 Accepts]: Start accepts. Operand has 75 places, 111 transitions, 1028 flow [2022-12-13 12:47:23,763 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:23,763 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:23,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 111 transitions, 1028 flow [2022-12-13 12:47:23,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 111 transitions, 1028 flow [2022-12-13 12:47:23,794 INFO L130 PetriNetUnfolder]: 90/333 cut-off events. [2022-12-13 12:47:23,794 INFO L131 PetriNetUnfolder]: For 935/982 co-relation queries the response was YES. [2022-12-13 12:47:23,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 333 events. 90/333 cut-off events. For 935/982 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2116 event pairs, 1 based on Foata normal form. 5/306 useless extension candidates. Maximal degree in co-relation 828. Up to 52 conditions per place. [2022-12-13 12:47:23,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 111 transitions, 1028 flow [2022-12-13 12:47:23,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-13 12:47:23,800 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:23,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 12:47:23,801 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 111 transitions, 1028 flow [2022-12-13 12:47:23,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:23,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:23,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:23,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:47:23,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:23,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash 722248821, now seen corresponding path program 1 times [2022-12-13 12:47:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:23,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420562890] [2022-12-13 12:47:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:24,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420562890] [2022-12-13 12:47:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420562890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:24,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598113855] [2022-12-13 12:47:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:24,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:24,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 12:47:24,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 111 transitions, 1028 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:24,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:24,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 12:47:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:24,489 INFO L130 PetriNetUnfolder]: 1688/2559 cut-off events. [2022-12-13 12:47:24,489 INFO L131 PetriNetUnfolder]: For 8601/8601 co-relation queries the response was YES. [2022-12-13 12:47:24,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10253 conditions, 2559 events. 1688/2559 cut-off events. For 8601/8601 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12466 event pairs, 309 based on Foata normal form. 1/2477 useless extension candidates. Maximal degree in co-relation 9310. Up to 574 conditions per place. [2022-12-13 12:47:24,512 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 153 selfloop transitions, 53 changer transitions 7/214 dead transitions. [2022-12-13 12:47:24,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 214 transitions, 1981 flow [2022-12-13 12:47:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:47:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:47:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2022-12-13 12:47:24,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-13 12:47:24,514 INFO L175 Difference]: Start difference. First operand has 75 places, 111 transitions, 1028 flow. Second operand 7 states and 145 transitions. [2022-12-13 12:47:24,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 214 transitions, 1981 flow [2022-12-13 12:47:24,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 214 transitions, 1922 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-13 12:47:24,552 INFO L231 Difference]: Finished difference. Result has 83 places, 126 transitions, 1279 flow [2022-12-13 12:47:24,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1279, PETRI_PLACES=83, PETRI_TRANSITIONS=126} [2022-12-13 12:47:24,553 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 45 predicate places. [2022-12-13 12:47:24,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:24,553 INFO L89 Accepts]: Start accepts. Operand has 83 places, 126 transitions, 1279 flow [2022-12-13 12:47:24,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:24,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:24,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 126 transitions, 1279 flow [2022-12-13 12:47:24,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 126 transitions, 1279 flow [2022-12-13 12:47:24,592 INFO L130 PetriNetUnfolder]: 100/345 cut-off events. [2022-12-13 12:47:24,592 INFO L131 PetriNetUnfolder]: For 1103/1159 co-relation queries the response was YES. [2022-12-13 12:47:24,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 345 events. 100/345 cut-off events. For 1103/1159 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2167 event pairs, 2 based on Foata normal form. 9/317 useless extension candidates. Maximal degree in co-relation 1012. Up to 66 conditions per place. [2022-12-13 12:47:24,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 126 transitions, 1279 flow [2022-12-13 12:47:24,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 1170 [2022-12-13 12:47:24,599 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:24,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 12:47:24,600 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 126 transitions, 1279 flow [2022-12-13 12:47:24,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:24,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:24,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:24,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:47:24,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:24,601 INFO L85 PathProgramCache]: Analyzing trace with hash 486527296, now seen corresponding path program 6 times [2022-12-13 12:47:24,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:24,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102768586] [2022-12-13 12:47:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:24,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102768586] [2022-12-13 12:47:24,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102768586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:24,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:24,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102954185] [2022-12-13 12:47:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:24,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:24,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:24,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:24,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:24,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 12:47:24,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 126 transitions, 1279 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:24,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:24,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 12:47:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:25,343 INFO L130 PetriNetUnfolder]: 1674/2524 cut-off events. [2022-12-13 12:47:25,343 INFO L131 PetriNetUnfolder]: For 9306/9306 co-relation queries the response was YES. [2022-12-13 12:47:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 2524 events. 1674/2524 cut-off events. For 9306/9306 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12175 event pairs, 171 based on Foata normal form. 1/2444 useless extension candidates. Maximal degree in co-relation 9806. Up to 773 conditions per place. [2022-12-13 12:47:25,362 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 157 selfloop transitions, 69 changer transitions 4/231 dead transitions. [2022-12-13 12:47:25,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 231 transitions, 2273 flow [2022-12-13 12:47:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:47:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:47:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2022-12-13 12:47:25,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-13 12:47:25,364 INFO L175 Difference]: Start difference. First operand has 83 places, 126 transitions, 1279 flow. Second operand 7 states and 159 transitions. [2022-12-13 12:47:25,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 231 transitions, 2273 flow [2022-12-13 12:47:25,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 231 transitions, 2165 flow, removed 53 selfloop flow, removed 1 redundant places. [2022-12-13 12:47:25,421 INFO L231 Difference]: Finished difference. Result has 92 places, 145 transitions, 1608 flow [2022-12-13 12:47:25,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1608, PETRI_PLACES=92, PETRI_TRANSITIONS=145} [2022-12-13 12:47:25,423 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-13 12:47:25,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:25,424 INFO L89 Accepts]: Start accepts. Operand has 92 places, 145 transitions, 1608 flow [2022-12-13 12:47:25,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:25,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:25,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 145 transitions, 1608 flow [2022-12-13 12:47:25,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 145 transitions, 1608 flow [2022-12-13 12:47:25,466 INFO L130 PetriNetUnfolder]: 110/345 cut-off events. [2022-12-13 12:47:25,466 INFO L131 PetriNetUnfolder]: For 1262/1329 co-relation queries the response was YES. [2022-12-13 12:47:25,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 345 events. 110/345 cut-off events. For 1262/1329 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2053 event pairs, 2 based on Foata normal form. 14/322 useless extension candidates. Maximal degree in co-relation 1207. Up to 67 conditions per place. [2022-12-13 12:47:25,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 145 transitions, 1608 flow [2022-12-13 12:47:25,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 1256 [2022-12-13 12:47:25,473 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:25,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 12:47:25,475 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 145 transitions, 1608 flow [2022-12-13 12:47:25,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:25,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:25,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:47:25,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1564440749, now seen corresponding path program 1 times [2022-12-13 12:47:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666756260] [2022-12-13 12:47:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:25,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:25,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666756260] [2022-12-13 12:47:25,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666756260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:25,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:25,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056452247] [2022-12-13 12:47:25,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:25,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:47:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:25,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:47:25,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:47:25,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 12:47:25,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 145 transitions, 1608 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:47:25,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:25,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 12:47:25,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:26,616 INFO L130 PetriNetUnfolder]: 4283/6179 cut-off events. [2022-12-13 12:47:26,616 INFO L131 PetriNetUnfolder]: For 29882/29882 co-relation queries the response was YES. [2022-12-13 12:47:26,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29739 conditions, 6179 events. 4283/6179 cut-off events. For 29882/29882 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 31966 event pairs, 1720 based on Foata normal form. 6/6011 useless extension candidates. Maximal degree in co-relation 28331. Up to 1525 conditions per place. [2022-12-13 12:47:26,655 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 204 selfloop transitions, 100 changer transitions 65/370 dead transitions. [2022-12-13 12:47:26,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 370 transitions, 4687 flow [2022-12-13 12:47:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:47:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:47:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2022-12-13 12:47:26,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-13 12:47:26,657 INFO L175 Difference]: Start difference. First operand has 92 places, 145 transitions, 1608 flow. Second operand 7 states and 161 transitions. [2022-12-13 12:47:26,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 370 transitions, 4687 flow [2022-12-13 12:47:26,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 370 transitions, 4617 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-12-13 12:47:26,807 INFO L231 Difference]: Finished difference. Result has 101 places, 200 transitions, 2569 flow [2022-12-13 12:47:26,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2569, PETRI_PLACES=101, PETRI_TRANSITIONS=200} [2022-12-13 12:47:26,808 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 63 predicate places. [2022-12-13 12:47:26,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:26,808 INFO L89 Accepts]: Start accepts. Operand has 101 places, 200 transitions, 2569 flow [2022-12-13 12:47:26,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:26,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:26,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 200 transitions, 2569 flow [2022-12-13 12:47:26,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 200 transitions, 2569 flow [2022-12-13 12:47:26,871 INFO L130 PetriNetUnfolder]: 225/611 cut-off events. [2022-12-13 12:47:26,872 INFO L131 PetriNetUnfolder]: For 3126/3273 co-relation queries the response was YES. [2022-12-13 12:47:26,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 611 events. 225/611 cut-off events. For 3126/3273 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3910 event pairs, 4 based on Foata normal form. 25/570 useless extension candidates. Maximal degree in co-relation 2668. Up to 120 conditions per place. [2022-12-13 12:47:26,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 200 transitions, 2569 flow [2022-12-13 12:47:26,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-13 12:47:28,294 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:47:28,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1487 [2022-12-13 12:47:28,295 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 199 transitions, 2569 flow [2022-12-13 12:47:28,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:47:28,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:28,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:28,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:47:28,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash 36705097, now seen corresponding path program 1 times [2022-12-13 12:47:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:28,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601856983] [2022-12-13 12:47:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:28,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601856983] [2022-12-13 12:47:28,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601856983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:28,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:28,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:28,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62858442] [2022-12-13 12:47:28,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:28,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:28,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:28,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:28,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 12:47:28,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 199 transitions, 2569 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:28,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:28,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 12:47:28,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:29,386 INFO L130 PetriNetUnfolder]: 3941/5742 cut-off events. [2022-12-13 12:47:29,386 INFO L131 PetriNetUnfolder]: For 28378/28378 co-relation queries the response was YES. [2022-12-13 12:47:29,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27386 conditions, 5742 events. 3941/5742 cut-off events. For 28378/28378 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30042 event pairs, 1089 based on Foata normal form. 1/5558 useless extension candidates. Maximal degree in co-relation 27307. Up to 1992 conditions per place. [2022-12-13 12:47:29,432 INFO L137 encePairwiseOnDemand]: 31/47 looper letters, 195 selfloop transitions, 59 changer transitions 10/265 dead transitions. [2022-12-13 12:47:29,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 265 transitions, 3461 flow [2022-12-13 12:47:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:47:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:47:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-13 12:47:29,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-13 12:47:29,434 INFO L175 Difference]: Start difference. First operand has 99 places, 199 transitions, 2569 flow. Second operand 6 states and 126 transitions. [2022-12-13 12:47:29,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 265 transitions, 3461 flow [2022-12-13 12:47:29,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 265 transitions, 3327 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 12:47:29,637 INFO L231 Difference]: Finished difference. Result has 103 places, 198 transitions, 2539 flow [2022-12-13 12:47:29,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2539, PETRI_PLACES=103, PETRI_TRANSITIONS=198} [2022-12-13 12:47:29,639 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 65 predicate places. [2022-12-13 12:47:29,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:29,639 INFO L89 Accepts]: Start accepts. Operand has 103 places, 198 transitions, 2539 flow [2022-12-13 12:47:29,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:29,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:29,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 198 transitions, 2539 flow [2022-12-13 12:47:29,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 198 transitions, 2539 flow [2022-12-13 12:47:29,702 INFO L130 PetriNetUnfolder]: 220/608 cut-off events. [2022-12-13 12:47:29,702 INFO L131 PetriNetUnfolder]: For 3753/3906 co-relation queries the response was YES. [2022-12-13 12:47:29,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 608 events. 220/608 cut-off events. For 3753/3906 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3952 event pairs, 1 based on Foata normal form. 25/563 useless extension candidates. Maximal degree in co-relation 2455. Up to 118 conditions per place. [2022-12-13 12:47:29,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 198 transitions, 2539 flow [2022-12-13 12:47:29,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 1712 [2022-12-13 12:47:29,718 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:29,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 12:47:29,719 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 198 transitions, 2539 flow [2022-12-13 12:47:29,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:29,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:29,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:47:29,720 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1131433246, now seen corresponding path program 1 times [2022-12-13 12:47:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:29,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257260145] [2022-12-13 12:47:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:29,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257260145] [2022-12-13 12:47:29,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257260145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:29,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:29,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249213705] [2022-12-13 12:47:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:29,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:47:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:47:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:47:29,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 12:47:29,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 198 transitions, 2539 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:47:29,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:29,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 12:47:29,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:31,021 INFO L130 PetriNetUnfolder]: 7001/10038 cut-off events. [2022-12-13 12:47:31,021 INFO L131 PetriNetUnfolder]: For 62671/62671 co-relation queries the response was YES. [2022-12-13 12:47:31,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49935 conditions, 10038 events. 7001/10038 cut-off events. For 62671/62671 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 55058 event pairs, 2821 based on Foata normal form. 10/9711 useless extension candidates. Maximal degree in co-relation 48391. Up to 3550 conditions per place. [2022-12-13 12:47:31,088 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 269 selfloop transitions, 83 changer transitions 61/414 dead transitions. [2022-12-13 12:47:31,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 414 transitions, 5900 flow [2022-12-13 12:47:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:47:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:47:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2022-12-13 12:47:31,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2022-12-13 12:47:31,090 INFO L175 Difference]: Start difference. First operand has 102 places, 198 transitions, 2539 flow. Second operand 6 states and 143 transitions. [2022-12-13 12:47:31,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 414 transitions, 5900 flow [2022-12-13 12:47:31,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 414 transitions, 5630 flow, removed 39 selfloop flow, removed 2 redundant places. [2022-12-13 12:47:31,437 INFO L231 Difference]: Finished difference. Result has 107 places, 246 transitions, 3282 flow [2022-12-13 12:47:31,437 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3282, PETRI_PLACES=107, PETRI_TRANSITIONS=246} [2022-12-13 12:47:31,438 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 69 predicate places. [2022-12-13 12:47:31,438 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:31,438 INFO L89 Accepts]: Start accepts. Operand has 107 places, 246 transitions, 3282 flow [2022-12-13 12:47:31,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:31,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:31,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 246 transitions, 3282 flow [2022-12-13 12:47:31,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 246 transitions, 3282 flow [2022-12-13 12:47:31,586 INFO L130 PetriNetUnfolder]: 354/878 cut-off events. [2022-12-13 12:47:31,587 INFO L131 PetriNetUnfolder]: For 5446/5616 co-relation queries the response was YES. [2022-12-13 12:47:31,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 878 events. 354/878 cut-off events. For 5446/5616 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5788 event pairs, 3 based on Foata normal form. 45/815 useless extension candidates. Maximal degree in co-relation 4040. Up to 220 conditions per place. [2022-12-13 12:47:31,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 246 transitions, 3282 flow [2022-12-13 12:47:31,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 2044 [2022-12-13 12:47:41,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:47:41,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9934 [2022-12-13 12:47:41,372 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 246 transitions, 3346 flow [2022-12-13 12:47:41,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:47:41,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:41,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:41,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:47:41,373 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -743780505, now seen corresponding path program 1 times [2022-12-13 12:47:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:41,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329810842] [2022-12-13 12:47:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:41,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329810842] [2022-12-13 12:47:41,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329810842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:41,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:41,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611577559] [2022-12-13 12:47:41,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:41,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:41,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:41,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-13 12:47:41,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 246 transitions, 3346 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:47:41,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:41,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-13 12:47:41,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:42,644 INFO L130 PetriNetUnfolder]: 6259/8979 cut-off events. [2022-12-13 12:47:42,645 INFO L131 PetriNetUnfolder]: For 50908/50908 co-relation queries the response was YES. [2022-12-13 12:47:42,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44328 conditions, 8979 events. 6259/8979 cut-off events. For 50908/50908 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 48595 event pairs, 2751 based on Foata normal form. 1/8561 useless extension candidates. Maximal degree in co-relation 42909. Up to 7303 conditions per place. [2022-12-13 12:47:42,707 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 257 selfloop transitions, 32 changer transitions 13/303 dead transitions. [2022-12-13 12:47:42,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 303 transitions, 4299 flow [2022-12-13 12:47:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:47:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:47:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 12:47:42,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4196078431372549 [2022-12-13 12:47:42,708 INFO L175 Difference]: Start difference. First operand has 107 places, 246 transitions, 3346 flow. Second operand 5 states and 107 transitions. [2022-12-13 12:47:42,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 303 transitions, 4299 flow [2022-12-13 12:47:42,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 303 transitions, 4143 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 12:47:42,966 INFO L231 Difference]: Finished difference. Result has 111 places, 244 transitions, 3224 flow [2022-12-13 12:47:42,966 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3224, PETRI_PLACES=111, PETRI_TRANSITIONS=244} [2022-12-13 12:47:42,966 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 73 predicate places. [2022-12-13 12:47:42,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:42,967 INFO L89 Accepts]: Start accepts. Operand has 111 places, 244 transitions, 3224 flow [2022-12-13 12:47:42,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:42,968 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:42,968 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 244 transitions, 3224 flow [2022-12-13 12:47:42,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 244 transitions, 3224 flow [2022-12-13 12:47:43,033 INFO L130 PetriNetUnfolder]: 351/871 cut-off events. [2022-12-13 12:47:43,033 INFO L131 PetriNetUnfolder]: For 5944/6125 co-relation queries the response was YES. [2022-12-13 12:47:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 871 events. 351/871 cut-off events. For 5944/6125 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5717 event pairs, 0 based on Foata normal form. 45/809 useless extension candidates. Maximal degree in co-relation 3893. Up to 224 conditions per place. [2022-12-13 12:47:43,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 244 transitions, 3224 flow [2022-12-13 12:47:43,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 2028 [2022-12-13 12:47:43,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:43,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:43,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:43,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:43,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:43,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:47:43,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:47:43,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 352 [2022-12-13 12:47:43,318 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 246 transitions, 3325 flow [2022-12-13 12:47:43,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:47:43,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:43,319 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:43,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:47:43,319 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1551909041, now seen corresponding path program 1 times [2022-12-13 12:47:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:43,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926139098] [2022-12-13 12:47:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:43,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:43,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926139098] [2022-12-13 12:47:43,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926139098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:43,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:43,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:43,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643209060] [2022-12-13 12:47:43,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:43,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:43,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:43,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:43,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:43,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-13 12:47:43,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 246 transitions, 3325 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:43,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:43,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-13 12:47:43,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:44,653 INFO L130 PetriNetUnfolder]: 6612/9631 cut-off events. [2022-12-13 12:47:44,654 INFO L131 PetriNetUnfolder]: For 57552/57552 co-relation queries the response was YES. [2022-12-13 12:47:44,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45779 conditions, 9631 events. 6612/9631 cut-off events. For 57552/57552 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 54613 event pairs, 2767 based on Foata normal form. 1/9204 useless extension candidates. Maximal degree in co-relation 44591. Up to 6822 conditions per place. [2022-12-13 12:47:44,724 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 260 selfloop transitions, 35 changer transitions 7/303 dead transitions. [2022-12-13 12:47:44,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 303 transitions, 4182 flow [2022-12-13 12:47:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:47:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:47:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 12:47:44,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2022-12-13 12:47:44,726 INFO L175 Difference]: Start difference. First operand has 110 places, 246 transitions, 3325 flow. Second operand 5 states and 107 transitions. [2022-12-13 12:47:44,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 303 transitions, 4182 flow [2022-12-13 12:47:44,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 303 transitions, 4117 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-13 12:47:44,963 INFO L231 Difference]: Finished difference. Result has 115 places, 245 transitions, 3284 flow [2022-12-13 12:47:44,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3084, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3284, PETRI_PLACES=115, PETRI_TRANSITIONS=245} [2022-12-13 12:47:44,963 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2022-12-13 12:47:44,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:44,964 INFO L89 Accepts]: Start accepts. Operand has 115 places, 245 transitions, 3284 flow [2022-12-13 12:47:44,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:44,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:44,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 245 transitions, 3284 flow [2022-12-13 12:47:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 245 transitions, 3284 flow [2022-12-13 12:47:45,060 INFO L130 PetriNetUnfolder]: 359/946 cut-off events. [2022-12-13 12:47:45,061 INFO L131 PetriNetUnfolder]: For 7634/8009 co-relation queries the response was YES. [2022-12-13 12:47:45,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4498 conditions, 946 events. 359/946 cut-off events. For 7634/8009 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6652 event pairs, 0 based on Foata normal form. 58/894 useless extension candidates. Maximal degree in co-relation 4179. Up to 226 conditions per place. [2022-12-13 12:47:45,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 245 transitions, 3284 flow [2022-12-13 12:47:45,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 2048 [2022-12-13 12:47:45,084 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:45,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 12:47:45,085 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 245 transitions, 3284 flow [2022-12-13 12:47:45,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:45,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:45,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:45,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:47:45,086 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash 396253427, now seen corresponding path program 2 times [2022-12-13 12:47:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:45,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395338120] [2022-12-13 12:47:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:45,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:45,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395338120] [2022-12-13 12:47:45,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395338120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:45,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:45,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:45,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145239493] [2022-12-13 12:47:45,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:45,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:45,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:45,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:45,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:45,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:47:45,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 245 transitions, 3284 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:45,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:45,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:47:45,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:46,334 INFO L130 PetriNetUnfolder]: 6528/9678 cut-off events. [2022-12-13 12:47:46,334 INFO L131 PetriNetUnfolder]: For 69064/69064 co-relation queries the response was YES. [2022-12-13 12:47:46,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46409 conditions, 9678 events. 6528/9678 cut-off events. For 69064/69064 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 56661 event pairs, 749 based on Foata normal form. 1/9344 useless extension candidates. Maximal degree in co-relation 45285. Up to 3570 conditions per place. [2022-12-13 12:47:46,389 INFO L137 encePairwiseOnDemand]: 32/50 looper letters, 226 selfloop transitions, 141 changer transitions 7/375 dead transitions. [2022-12-13 12:47:46,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 375 transitions, 5424 flow [2022-12-13 12:47:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:47:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:47:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-13 12:47:46,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4085714285714286 [2022-12-13 12:47:46,391 INFO L175 Difference]: Start difference. First operand has 115 places, 245 transitions, 3284 flow. Second operand 7 states and 143 transitions. [2022-12-13 12:47:46,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 375 transitions, 5424 flow [2022-12-13 12:47:46,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 375 transitions, 5382 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 12:47:46,535 INFO L231 Difference]: Finished difference. Result has 122 places, 288 transitions, 4442 flow [2022-12-13 12:47:46,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3258, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4442, PETRI_PLACES=122, PETRI_TRANSITIONS=288} [2022-12-13 12:47:46,535 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 84 predicate places. [2022-12-13 12:47:46,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:46,536 INFO L89 Accepts]: Start accepts. Operand has 122 places, 288 transitions, 4442 flow [2022-12-13 12:47:46,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:46,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:46,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 288 transitions, 4442 flow [2022-12-13 12:47:46,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 288 transitions, 4442 flow [2022-12-13 12:47:46,616 INFO L130 PetriNetUnfolder]: 398/997 cut-off events. [2022-12-13 12:47:46,616 INFO L131 PetriNetUnfolder]: For 10374/10857 co-relation queries the response was YES. [2022-12-13 12:47:46,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5335 conditions, 997 events. 398/997 cut-off events. For 10374/10857 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6924 event pairs, 0 based on Foata normal form. 57/967 useless extension candidates. Maximal degree in co-relation 5012. Up to 265 conditions per place. [2022-12-13 12:47:46,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 288 transitions, 4442 flow [2022-12-13 12:47:46,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 2150 [2022-12-13 12:47:46,639 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:46,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 12:47:46,639 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 288 transitions, 4442 flow [2022-12-13 12:47:46,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:46,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:46,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:46,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:47:46,640 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:46,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:46,640 INFO L85 PathProgramCache]: Analyzing trace with hash -764813503, now seen corresponding path program 3 times [2022-12-13 12:47:46,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:46,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678438545] [2022-12-13 12:47:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:46,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:46,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:46,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678438545] [2022-12-13 12:47:46,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678438545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:46,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:46,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:46,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631132239] [2022-12-13 12:47:46,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:46,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:46,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:46,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:46,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:47:46,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 288 transitions, 4442 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:46,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:46,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:47:46,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:47,873 INFO L130 PetriNetUnfolder]: 6444/9345 cut-off events. [2022-12-13 12:47:47,873 INFO L131 PetriNetUnfolder]: For 72031/72031 co-relation queries the response was YES. [2022-12-13 12:47:47,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47921 conditions, 9345 events. 6444/9345 cut-off events. For 72031/72031 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 52238 event pairs, 2735 based on Foata normal form. 1/8921 useless extension candidates. Maximal degree in co-relation 46683. Up to 6822 conditions per place. [2022-12-13 12:47:47,929 INFO L137 encePairwiseOnDemand]: 43/50 looper letters, 269 selfloop transitions, 49 changer transitions 7/326 dead transitions. [2022-12-13 12:47:47,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 326 transitions, 5241 flow [2022-12-13 12:47:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:47:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:47:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 12:47:47,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.408 [2022-12-13 12:47:47,931 INFO L175 Difference]: Start difference. First operand has 122 places, 288 transitions, 4442 flow. Second operand 5 states and 102 transitions. [2022-12-13 12:47:47,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 326 transitions, 5241 flow [2022-12-13 12:47:48,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 326 transitions, 5115 flow, removed 63 selfloop flow, removed 0 redundant places. [2022-12-13 12:47:48,166 INFO L231 Difference]: Finished difference. Result has 127 places, 282 transitions, 4355 flow [2022-12-13 12:47:48,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4318, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4355, PETRI_PLACES=127, PETRI_TRANSITIONS=282} [2022-12-13 12:47:48,167 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2022-12-13 12:47:48,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:48,167 INFO L89 Accepts]: Start accepts. Operand has 127 places, 282 transitions, 4355 flow [2022-12-13 12:47:48,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:48,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:48,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 282 transitions, 4355 flow [2022-12-13 12:47:48,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 282 transitions, 4355 flow [2022-12-13 12:47:48,243 INFO L130 PetriNetUnfolder]: 385/973 cut-off events. [2022-12-13 12:47:48,243 INFO L131 PetriNetUnfolder]: For 9690/9894 co-relation queries the response was YES. [2022-12-13 12:47:48,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 973 events. 385/973 cut-off events. For 9690/9894 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6750 event pairs, 0 based on Foata normal form. 58/951 useless extension candidates. Maximal degree in co-relation 5001. Up to 241 conditions per place. [2022-12-13 12:47:48,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 282 transitions, 4355 flow [2022-12-13 12:47:48,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 2114 [2022-12-13 12:47:48,260 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:48,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 12:47:48,261 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 282 transitions, 4355 flow [2022-12-13 12:47:48,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:48,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:48,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:48,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:47:48,261 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1277170295, now seen corresponding path program 4 times [2022-12-13 12:47:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:48,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044051959] [2022-12-13 12:47:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:48,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044051959] [2022-12-13 12:47:48,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044051959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:48,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:48,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115075160] [2022-12-13 12:47:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:48,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:48,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:48,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:47:48,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 282 transitions, 4355 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:48,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:48,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:47:48,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:49,625 INFO L130 PetriNetUnfolder]: 7483/11171 cut-off events. [2022-12-13 12:47:49,625 INFO L131 PetriNetUnfolder]: For 93046/93046 co-relation queries the response was YES. [2022-12-13 12:47:49,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54712 conditions, 11171 events. 7483/11171 cut-off events. For 93046/93046 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 68462 event pairs, 587 based on Foata normal form. 1/10747 useless extension candidates. Maximal degree in co-relation 53694. Up to 4253 conditions per place. [2022-12-13 12:47:49,688 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 371 selfloop transitions, 68 changer transitions 11/451 dead transitions. [2022-12-13 12:47:49,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 451 transitions, 7228 flow [2022-12-13 12:47:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:47:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:47:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2022-12-13 12:47:49,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2022-12-13 12:47:49,690 INFO L175 Difference]: Start difference. First operand has 127 places, 282 transitions, 4355 flow. Second operand 6 states and 146 transitions. [2022-12-13 12:47:49,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 451 transitions, 7228 flow [2022-12-13 12:47:49,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 451 transitions, 7014 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-13 12:47:49,936 INFO L231 Difference]: Finished difference. Result has 132 places, 314 transitions, 5095 flow [2022-12-13 12:47:49,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4202, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5095, PETRI_PLACES=132, PETRI_TRANSITIONS=314} [2022-12-13 12:47:49,937 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2022-12-13 12:47:49,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:49,937 INFO L89 Accepts]: Start accepts. Operand has 132 places, 314 transitions, 5095 flow [2022-12-13 12:47:49,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:49,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:49,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 314 transitions, 5095 flow [2022-12-13 12:47:49,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 314 transitions, 5095 flow [2022-12-13 12:47:50,119 INFO L130 PetriNetUnfolder]: 572/1487 cut-off events. [2022-12-13 12:47:50,119 INFO L131 PetriNetUnfolder]: For 15664/15997 co-relation queries the response was YES. [2022-12-13 12:47:50,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7550 conditions, 1487 events. 572/1487 cut-off events. For 15664/15997 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 11659 event pairs, 12 based on Foata normal form. 83/1438 useless extension candidates. Maximal degree in co-relation 7248. Up to 328 conditions per place. [2022-12-13 12:47:50,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 314 transitions, 5095 flow [2022-12-13 12:47:50,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 2316 [2022-12-13 12:47:50,148 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:50,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 12:47:50,148 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 314 transitions, 5095 flow [2022-12-13 12:47:50,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:50,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:50,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:50,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:47:50,149 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -602545699, now seen corresponding path program 5 times [2022-12-13 12:47:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:50,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643001367] [2022-12-13 12:47:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:50,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643001367] [2022-12-13 12:47:50,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643001367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:50,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:50,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870850735] [2022-12-13 12:47:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:50,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:50,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:47:50,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 314 transitions, 5095 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:50,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:50,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:47:50,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:52,001 INFO L130 PetriNetUnfolder]: 9075/13224 cut-off events. [2022-12-13 12:47:52,001 INFO L131 PetriNetUnfolder]: For 108487/108487 co-relation queries the response was YES. [2022-12-13 12:47:52,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67448 conditions, 13224 events. 9075/13224 cut-off events. For 108487/108487 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 79129 event pairs, 558 based on Foata normal form. 1/12680 useless extension candidates. Maximal degree in co-relation 66233. Up to 3122 conditions per place. [2022-12-13 12:47:52,083 INFO L137 encePairwiseOnDemand]: 31/50 looper letters, 326 selfloop transitions, 178 changer transitions 11/516 dead transitions. [2022-12-13 12:47:52,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 516 transitions, 7992 flow [2022-12-13 12:47:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:47:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:47:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2022-12-13 12:47:52,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2022-12-13 12:47:52,084 INFO L175 Difference]: Start difference. First operand has 132 places, 314 transitions, 5095 flow. Second operand 9 states and 213 transitions. [2022-12-13 12:47:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 516 transitions, 7992 flow [2022-12-13 12:47:52,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 516 transitions, 7928 flow, removed 32 selfloop flow, removed 0 redundant places. [2022-12-13 12:47:52,527 INFO L231 Difference]: Finished difference. Result has 146 places, 345 transitions, 6136 flow [2022-12-13 12:47:52,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5059, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6136, PETRI_PLACES=146, PETRI_TRANSITIONS=345} [2022-12-13 12:47:52,527 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 108 predicate places. [2022-12-13 12:47:52,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:52,527 INFO L89 Accepts]: Start accepts. Operand has 146 places, 345 transitions, 6136 flow [2022-12-13 12:47:52,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:52,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:52,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 345 transitions, 6136 flow [2022-12-13 12:47:52,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 345 transitions, 6136 flow [2022-12-13 12:47:52,663 INFO L130 PetriNetUnfolder]: 661/1582 cut-off events. [2022-12-13 12:47:52,663 INFO L131 PetriNetUnfolder]: For 20516/20915 co-relation queries the response was YES. [2022-12-13 12:47:52,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9097 conditions, 1582 events. 661/1582 cut-off events. For 20516/20915 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 11846 event pairs, 0 based on Foata normal form. 94/1567 useless extension candidates. Maximal degree in co-relation 8812. Up to 374 conditions per place. [2022-12-13 12:47:52,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 345 transitions, 6136 flow [2022-12-13 12:47:52,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 12:47:52,696 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:52,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 12:47:52,697 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 345 transitions, 6136 flow [2022-12-13 12:47:52,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:52,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:52,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:52,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:47:52,697 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1656863012, now seen corresponding path program 1 times [2022-12-13 12:47:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:52,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562008872] [2022-12-13 12:47:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:52,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562008872] [2022-12-13 12:47:52,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562008872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:52,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:52,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000368840] [2022-12-13 12:47:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:52,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:47:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:47:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:47:52,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:47:52,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 345 transitions, 6136 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:47:52,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:52,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:47:52,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:54,515 INFO L130 PetriNetUnfolder]: 8789/12861 cut-off events. [2022-12-13 12:47:54,515 INFO L131 PetriNetUnfolder]: For 138340/138340 co-relation queries the response was YES. [2022-12-13 12:47:54,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69951 conditions, 12861 events. 8789/12861 cut-off events. For 138340/138340 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 77501 event pairs, 1696 based on Foata normal form. 84/12394 useless extension candidates. Maximal degree in co-relation 69437. Up to 10263 conditions per place. [2022-12-13 12:47:54,582 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 356 selfloop transitions, 28 changer transitions 0/385 dead transitions. [2022-12-13 12:47:54,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 385 transitions, 7138 flow [2022-12-13 12:47:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:47:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:47:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 12:47:54,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.465 [2022-12-13 12:47:54,584 INFO L175 Difference]: Start difference. First operand has 146 places, 345 transitions, 6136 flow. Second operand 4 states and 93 transitions. [2022-12-13 12:47:54,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 385 transitions, 7138 flow [2022-12-13 12:47:55,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 385 transitions, 6926 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-13 12:47:55,361 INFO L231 Difference]: Finished difference. Result has 148 places, 336 transitions, 5757 flow [2022-12-13 12:47:55,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5610, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5757, PETRI_PLACES=148, PETRI_TRANSITIONS=336} [2022-12-13 12:47:55,362 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2022-12-13 12:47:55,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:55,362 INFO L89 Accepts]: Start accepts. Operand has 148 places, 336 transitions, 5757 flow [2022-12-13 12:47:55,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:55,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:55,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 336 transitions, 5757 flow [2022-12-13 12:47:55,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 336 transitions, 5757 flow [2022-12-13 12:47:55,499 INFO L130 PetriNetUnfolder]: 638/1563 cut-off events. [2022-12-13 12:47:55,499 INFO L131 PetriNetUnfolder]: For 19522/19792 co-relation queries the response was YES. [2022-12-13 12:47:55,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8579 conditions, 1563 events. 638/1563 cut-off events. For 19522/19792 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 11847 event pairs, 0 based on Foata normal form. 89/1538 useless extension candidates. Maximal degree in co-relation 8284. Up to 354 conditions per place. [2022-12-13 12:47:55,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 336 transitions, 5757 flow [2022-12-13 12:47:55,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 2422 [2022-12-13 12:47:55,541 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:55,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 12:47:55,542 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 336 transitions, 5757 flow [2022-12-13 12:47:55,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:47:55,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:55,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:55,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:47:55,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash 13086328, now seen corresponding path program 2 times [2022-12-13 12:47:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261147498] [2022-12-13 12:47:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:55,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261147498] [2022-12-13 12:47:55,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261147498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:55,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:55,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:55,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290439454] [2022-12-13 12:47:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:55,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:47:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:55,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:47:55,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:47:55,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:47:55,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 336 transitions, 5757 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:47:55,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:55,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:47:55,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:47:57,314 INFO L130 PetriNetUnfolder]: 8141/11822 cut-off events. [2022-12-13 12:47:57,315 INFO L131 PetriNetUnfolder]: For 125528/125528 co-relation queries the response was YES. [2022-12-13 12:47:57,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63776 conditions, 11822 events. 8141/11822 cut-off events. For 125528/125528 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 69688 event pairs, 1007 based on Foata normal form. 84/11395 useless extension candidates. Maximal degree in co-relation 62722. Up to 7279 conditions per place. [2022-12-13 12:47:57,393 INFO L137 encePairwiseOnDemand]: 42/50 looper letters, 331 selfloop transitions, 63 changer transitions 8/403 dead transitions. [2022-12-13 12:47:57,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 403 transitions, 7123 flow [2022-12-13 12:47:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:47:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:47:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-13 12:47:57,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.436 [2022-12-13 12:47:57,394 INFO L175 Difference]: Start difference. First operand has 148 places, 336 transitions, 5757 flow. Second operand 5 states and 109 transitions. [2022-12-13 12:47:57,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 403 transitions, 7123 flow [2022-12-13 12:47:58,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 403 transitions, 6959 flow, removed 40 selfloop flow, removed 3 redundant places. [2022-12-13 12:47:58,141 INFO L231 Difference]: Finished difference. Result has 150 places, 325 transitions, 5622 flow [2022-12-13 12:47:58,142 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5441, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5622, PETRI_PLACES=150, PETRI_TRANSITIONS=325} [2022-12-13 12:47:58,142 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 112 predicate places. [2022-12-13 12:47:58,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:47:58,142 INFO L89 Accepts]: Start accepts. Operand has 150 places, 325 transitions, 5622 flow [2022-12-13 12:47:58,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:47:58,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:47:58,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 325 transitions, 5622 flow [2022-12-13 12:47:58,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 325 transitions, 5622 flow [2022-12-13 12:47:58,292 INFO L130 PetriNetUnfolder]: 589/1423 cut-off events. [2022-12-13 12:47:58,292 INFO L131 PetriNetUnfolder]: For 18550/19003 co-relation queries the response was YES. [2022-12-13 12:47:58,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8236 conditions, 1423 events. 589/1423 cut-off events. For 18550/19003 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 10377 event pairs, 0 based on Foata normal form. 89/1413 useless extension candidates. Maximal degree in co-relation 7949. Up to 327 conditions per place. [2022-12-13 12:47:58,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 325 transitions, 5622 flow [2022-12-13 12:47:58,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 2346 [2022-12-13 12:47:58,325 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:47:58,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-13 12:47:58,326 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 325 transitions, 5622 flow [2022-12-13 12:47:58,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:47:58,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:47:58,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:47:58,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:47:58,327 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:47:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:47:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash 628300647, now seen corresponding path program 6 times [2022-12-13 12:47:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:47:58,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129550740] [2022-12-13 12:47:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:47:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:47:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:47:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:47:58,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:47:58,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129550740] [2022-12-13 12:47:58,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129550740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:47:58,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:47:58,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:47:58,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510002989] [2022-12-13 12:47:58,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:47:58,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:47:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:47:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:47:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:47:58,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:47:58,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 325 transitions, 5622 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:47:58,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:47:58,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:47:58,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:00,245 INFO L130 PetriNetUnfolder]: 8099/11800 cut-off events. [2022-12-13 12:48:00,245 INFO L131 PetriNetUnfolder]: For 126905/126905 co-relation queries the response was YES. [2022-12-13 12:48:00,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65449 conditions, 11800 events. 8099/11800 cut-off events. For 126905/126905 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 68861 event pairs, 2148 based on Foata normal form. 1/11250 useless extension candidates. Maximal degree in co-relation 64165. Up to 4912 conditions per place. [2022-12-13 12:48:00,307 INFO L137 encePairwiseOnDemand]: 33/50 looper letters, 231 selfloop transitions, 115 changer transitions 20/367 dead transitions. [2022-12-13 12:48:00,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 367 transitions, 6484 flow [2022-12-13 12:48:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:48:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:48:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-13 12:48:00,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39 [2022-12-13 12:48:00,309 INFO L175 Difference]: Start difference. First operand has 150 places, 325 transitions, 5622 flow. Second operand 6 states and 117 transitions. [2022-12-13 12:48:00,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 367 transitions, 6484 flow [2022-12-13 12:48:00,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 367 transitions, 6464 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 12:48:00,852 INFO L231 Difference]: Finished difference. Result has 155 places, 317 transitions, 5724 flow [2022-12-13 12:48:00,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5602, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5724, PETRI_PLACES=155, PETRI_TRANSITIONS=317} [2022-12-13 12:48:00,853 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2022-12-13 12:48:00,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:00,853 INFO L89 Accepts]: Start accepts. Operand has 155 places, 317 transitions, 5724 flow [2022-12-13 12:48:00,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:00,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:00,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 317 transitions, 5724 flow [2022-12-13 12:48:00,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 317 transitions, 5724 flow [2022-12-13 12:48:01,036 INFO L130 PetriNetUnfolder]: 580/1388 cut-off events. [2022-12-13 12:48:01,036 INFO L131 PetriNetUnfolder]: For 20292/20738 co-relation queries the response was YES. [2022-12-13 12:48:01,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8357 conditions, 1388 events. 580/1388 cut-off events. For 20292/20738 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 9974 event pairs, 0 based on Foata normal form. 98/1390 useless extension candidates. Maximal degree in co-relation 8259. Up to 321 conditions per place. [2022-12-13 12:48:01,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 317 transitions, 5724 flow [2022-12-13 12:48:01,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 2310 [2022-12-13 12:48:01,066 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:01,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 12:48:01,067 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 317 transitions, 5724 flow [2022-12-13 12:48:01,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:01,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:01,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:01,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:48:01,067 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1514842442, now seen corresponding path program 3 times [2022-12-13 12:48:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:01,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987892453] [2022-12-13 12:48:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:01,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:01,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987892453] [2022-12-13 12:48:01,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987892453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:01,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:01,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512076884] [2022-12-13 12:48:01,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:01,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:01,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:01,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:01,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 12:48:01,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 317 transitions, 5724 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:01,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:01,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 12:48:01,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:02,880 INFO L130 PetriNetUnfolder]: 7784/11284 cut-off events. [2022-12-13 12:48:02,880 INFO L131 PetriNetUnfolder]: For 133015/133015 co-relation queries the response was YES. [2022-12-13 12:48:02,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64010 conditions, 11284 events. 7784/11284 cut-off events. For 133015/133015 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 65248 event pairs, 1647 based on Foata normal form. 84/10853 useless extension candidates. Maximal degree in co-relation 63891. Up to 9251 conditions per place. [2022-12-13 12:48:02,943 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 313 selfloop transitions, 27 changer transitions 0/341 dead transitions. [2022-12-13 12:48:02,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 341 transitions, 6337 flow [2022-12-13 12:48:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:48:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 12:48:02,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.465 [2022-12-13 12:48:02,944 INFO L175 Difference]: Start difference. First operand has 152 places, 317 transitions, 5724 flow. Second operand 4 states and 93 transitions. [2022-12-13 12:48:02,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 341 transitions, 6337 flow [2022-12-13 12:48:03,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 341 transitions, 5859 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-13 12:48:03,499 INFO L231 Difference]: Finished difference. Result has 145 places, 303 transitions, 4946 flow [2022-12-13 12:48:03,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4892, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4946, PETRI_PLACES=145, PETRI_TRANSITIONS=303} [2022-12-13 12:48:03,499 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2022-12-13 12:48:03,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:03,499 INFO L89 Accepts]: Start accepts. Operand has 145 places, 303 transitions, 4946 flow [2022-12-13 12:48:03,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:03,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:03,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 303 transitions, 4946 flow [2022-12-13 12:48:03,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 303 transitions, 4946 flow [2022-12-13 12:48:03,613 INFO L130 PetriNetUnfolder]: 558/1340 cut-off events. [2022-12-13 12:48:03,613 INFO L131 PetriNetUnfolder]: For 14798/15156 co-relation queries the response was YES. [2022-12-13 12:48:03,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7432 conditions, 1340 events. 558/1340 cut-off events. For 14798/15156 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 9539 event pairs, 0 based on Foata normal form. 98/1342 useless extension candidates. Maximal degree in co-relation 7183. Up to 309 conditions per place. [2022-12-13 12:48:03,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 303 transitions, 4946 flow [2022-12-13 12:48:03,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 2202 [2022-12-13 12:48:03,643 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:03,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 12:48:03,645 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 303 transitions, 4946 flow [2022-12-13 12:48:03,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:03,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:03,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:03,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 12:48:03,646 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1899556435, now seen corresponding path program 1 times [2022-12-13 12:48:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:03,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734460470] [2022-12-13 12:48:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:03,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:03,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734460470] [2022-12-13 12:48:03,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734460470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:03,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:03,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:03,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470148717] [2022-12-13 12:48:03,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:03,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:03,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:03,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:03,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:03,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 303 transitions, 4946 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:03,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:03,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:03,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:05,371 INFO L130 PetriNetUnfolder]: 8021/11694 cut-off events. [2022-12-13 12:48:05,371 INFO L131 PetriNetUnfolder]: For 103843/103843 co-relation queries the response was YES. [2022-12-13 12:48:05,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61885 conditions, 11694 events. 8021/11694 cut-off events. For 103843/103843 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 68832 event pairs, 1415 based on Foata normal form. 2/11155 useless extension candidates. Maximal degree in co-relation 60570. Up to 5873 conditions per place. [2022-12-13 12:48:05,441 INFO L137 encePairwiseOnDemand]: 32/49 looper letters, 261 selfloop transitions, 146 changer transitions 7/415 dead transitions. [2022-12-13 12:48:05,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 415 transitions, 6778 flow [2022-12-13 12:48:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:48:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:48:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2022-12-13 12:48:05,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4227405247813411 [2022-12-13 12:48:05,442 INFO L175 Difference]: Start difference. First operand has 145 places, 303 transitions, 4946 flow. Second operand 7 states and 145 transitions. [2022-12-13 12:48:05,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 415 transitions, 6778 flow [2022-12-13 12:48:06,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 415 transitions, 6735 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:48:06,032 INFO L231 Difference]: Finished difference. Result has 151 places, 331 transitions, 5778 flow [2022-12-13 12:48:06,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4910, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5778, PETRI_PLACES=151, PETRI_TRANSITIONS=331} [2022-12-13 12:48:06,033 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 113 predicate places. [2022-12-13 12:48:06,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:06,033 INFO L89 Accepts]: Start accepts. Operand has 151 places, 331 transitions, 5778 flow [2022-12-13 12:48:06,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:06,035 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:06,035 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 331 transitions, 5778 flow [2022-12-13 12:48:06,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 331 transitions, 5778 flow [2022-12-13 12:48:06,214 INFO L130 PetriNetUnfolder]: 602/1452 cut-off events. [2022-12-13 12:48:06,214 INFO L131 PetriNetUnfolder]: For 17153/17523 co-relation queries the response was YES. [2022-12-13 12:48:06,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 1452 events. 602/1452 cut-off events. For 17153/17523 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 10598 event pairs, 0 based on Foata normal form. 91/1438 useless extension candidates. Maximal degree in co-relation 8115. Up to 339 conditions per place. [2022-12-13 12:48:06,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 331 transitions, 5778 flow [2022-12-13 12:48:06,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 2298 [2022-12-13 12:48:06,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:06,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 12:48:06,258 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 331 transitions, 5778 flow [2022-12-13 12:48:06,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:06,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:06,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:06,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 12:48:06,258 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash 951502139, now seen corresponding path program 2 times [2022-12-13 12:48:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:06,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848255602] [2022-12-13 12:48:06,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:06,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848255602] [2022-12-13 12:48:06,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848255602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:06,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:06,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:48:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972964228] [2022-12-13 12:48:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:06,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:48:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:48:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:48:06,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:06,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 331 transitions, 5778 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:48:06,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:06,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:06,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:09,221 INFO L130 PetriNetUnfolder]: 12307/18324 cut-off events. [2022-12-13 12:48:09,221 INFO L131 PetriNetUnfolder]: For 173634/173634 co-relation queries the response was YES. [2022-12-13 12:48:09,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98738 conditions, 18324 events. 12307/18324 cut-off events. For 173634/173634 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 119300 event pairs, 1343 based on Foata normal form. 3/17475 useless extension candidates. Maximal degree in co-relation 96595. Up to 6684 conditions per place. [2022-12-13 12:48:09,343 INFO L137 encePairwiseOnDemand]: 27/49 looper letters, 586 selfloop transitions, 172 changer transitions 24/783 dead transitions. [2022-12-13 12:48:09,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 783 transitions, 13375 flow [2022-12-13 12:48:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:48:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:48:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 275 transitions. [2022-12-13 12:48:09,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2022-12-13 12:48:09,345 INFO L175 Difference]: Start difference. First operand has 151 places, 331 transitions, 5778 flow. Second operand 11 states and 275 transitions. [2022-12-13 12:48:09,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 783 transitions, 13375 flow [2022-12-13 12:48:10,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 783 transitions, 13197 flow, removed 52 selfloop flow, removed 2 redundant places. [2022-12-13 12:48:10,809 INFO L231 Difference]: Finished difference. Result has 167 places, 426 transitions, 8267 flow [2022-12-13 12:48:10,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5690, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8267, PETRI_PLACES=167, PETRI_TRANSITIONS=426} [2022-12-13 12:48:10,809 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 129 predicate places. [2022-12-13 12:48:10,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:10,810 INFO L89 Accepts]: Start accepts. Operand has 167 places, 426 transitions, 8267 flow [2022-12-13 12:48:10,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:10,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:10,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 426 transitions, 8267 flow [2022-12-13 12:48:10,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 426 transitions, 8267 flow [2022-12-13 12:48:11,026 INFO L130 PetriNetUnfolder]: 899/2341 cut-off events. [2022-12-13 12:48:11,027 INFO L131 PetriNetUnfolder]: For 31672/32311 co-relation queries the response was YES. [2022-12-13 12:48:11,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13777 conditions, 2341 events. 899/2341 cut-off events. For 31672/32311 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 19779 event pairs, 0 based on Foata normal form. 175/2353 useless extension candidates. Maximal degree in co-relation 13397. Up to 541 conditions per place. [2022-12-13 12:48:11,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 426 transitions, 8267 flow [2022-12-13 12:48:11,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 2964 [2022-12-13 12:48:11,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:11,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-13 12:48:11,073 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 426 transitions, 8267 flow [2022-12-13 12:48:11,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:48:11,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:11,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:11,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 12:48:11,074 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1444610304, now seen corresponding path program 1 times [2022-12-13 12:48:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:11,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773672392] [2022-12-13 12:48:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:11,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773672392] [2022-12-13 12:48:11,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773672392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:11,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:11,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893741659] [2022-12-13 12:48:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:11,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:11,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:11,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 426 transitions, 8267 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:11,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:11,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:11,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:13,789 INFO L130 PetriNetUnfolder]: 11816/17664 cut-off events. [2022-12-13 12:48:13,790 INFO L131 PetriNetUnfolder]: For 198817/198817 co-relation queries the response was YES. [2022-12-13 12:48:13,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97201 conditions, 17664 events. 11816/17664 cut-off events. For 198817/198817 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 114846 event pairs, 1810 based on Foata normal form. 144/16958 useless extension candidates. Maximal degree in co-relation 95696. Up to 13457 conditions per place. [2022-12-13 12:48:13,891 INFO L137 encePairwiseOnDemand]: 44/49 looper letters, 392 selfloop transitions, 54 changer transitions 0/447 dead transitions. [2022-12-13 12:48:13,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 447 transitions, 9020 flow [2022-12-13 12:48:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:48:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 12:48:13,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-13 12:48:13,892 INFO L175 Difference]: Start difference. First operand has 167 places, 426 transitions, 8267 flow. Second operand 4 states and 92 transitions. [2022-12-13 12:48:13,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 447 transitions, 9020 flow [2022-12-13 12:48:15,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 447 transitions, 8844 flow, removed 29 selfloop flow, removed 5 redundant places. [2022-12-13 12:48:15,507 INFO L231 Difference]: Finished difference. Result has 165 places, 413 transitions, 7891 flow [2022-12-13 12:48:15,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7675, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7891, PETRI_PLACES=165, PETRI_TRANSITIONS=413} [2022-12-13 12:48:15,507 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2022-12-13 12:48:15,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:15,508 INFO L89 Accepts]: Start accepts. Operand has 165 places, 413 transitions, 7891 flow [2022-12-13 12:48:15,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:15,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:15,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 413 transitions, 7891 flow [2022-12-13 12:48:15,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 413 transitions, 7891 flow [2022-12-13 12:48:15,742 INFO L130 PetriNetUnfolder]: 872/2319 cut-off events. [2022-12-13 12:48:15,743 INFO L131 PetriNetUnfolder]: For 31499/32259 co-relation queries the response was YES. [2022-12-13 12:48:15,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13227 conditions, 2319 events. 872/2319 cut-off events. For 31499/32259 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 19739 event pairs, 0 based on Foata normal form. 194/2347 useless extension candidates. Maximal degree in co-relation 12859. Up to 511 conditions per place. [2022-12-13 12:48:15,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 413 transitions, 7891 flow [2022-12-13 12:48:15,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 2826 [2022-12-13 12:48:15,798 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:15,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-13 12:48:15,799 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 413 transitions, 7891 flow [2022-12-13 12:48:15,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:15,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:15,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:15,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 12:48:15,800 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash -580093663, now seen corresponding path program 3 times [2022-12-13 12:48:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:15,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311523747] [2022-12-13 12:48:15,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:15,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:15,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:15,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311523747] [2022-12-13 12:48:15,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311523747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:15,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:15,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:15,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671940500] [2022-12-13 12:48:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:15,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:15,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:15,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:15,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:15,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 413 transitions, 7891 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:15,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:15,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:15,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:18,455 INFO L130 PetriNetUnfolder]: 11816/17570 cut-off events. [2022-12-13 12:48:18,455 INFO L131 PetriNetUnfolder]: For 196713/196713 co-relation queries the response was YES. [2022-12-13 12:48:18,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96795 conditions, 17570 events. 11816/17570 cut-off events. For 196713/196713 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 112861 event pairs, 3772 based on Foata normal form. 2/16656 useless extension candidates. Maximal degree in co-relation 94598. Up to 10126 conditions per place. [2022-12-13 12:48:18,566 INFO L137 encePairwiseOnDemand]: 32/49 looper letters, 314 selfloop transitions, 161 changer transitions 9/485 dead transitions. [2022-12-13 12:48:18,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 485 transitions, 9232 flow [2022-12-13 12:48:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:48:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:48:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-13 12:48:18,567 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3965014577259475 [2022-12-13 12:48:18,567 INFO L175 Difference]: Start difference. First operand has 165 places, 413 transitions, 7891 flow. Second operand 7 states and 136 transitions. [2022-12-13 12:48:18,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 485 transitions, 9232 flow [2022-12-13 12:48:19,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 485 transitions, 9232 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:48:19,931 INFO L231 Difference]: Finished difference. Result has 172 places, 409 transitions, 8131 flow [2022-12-13 12:48:19,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7891, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8131, PETRI_PLACES=172, PETRI_TRANSITIONS=409} [2022-12-13 12:48:19,931 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 134 predicate places. [2022-12-13 12:48:19,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:19,931 INFO L89 Accepts]: Start accepts. Operand has 172 places, 409 transitions, 8131 flow [2022-12-13 12:48:19,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:19,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:19,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 409 transitions, 8131 flow [2022-12-13 12:48:19,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 409 transitions, 8131 flow [2022-12-13 12:48:20,146 INFO L130 PetriNetUnfolder]: 865/2301 cut-off events. [2022-12-13 12:48:20,147 INFO L131 PetriNetUnfolder]: For 33760/34451 co-relation queries the response was YES. [2022-12-13 12:48:20,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13545 conditions, 2301 events. 865/2301 cut-off events. For 33760/34451 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 19513 event pairs, 0 based on Foata normal form. 169/2306 useless extension candidates. Maximal degree in co-relation 13149. Up to 504 conditions per place. [2022-12-13 12:48:20,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 409 transitions, 8131 flow [2022-12-13 12:48:20,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 2786 [2022-12-13 12:48:20,195 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:20,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-13 12:48:20,195 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 409 transitions, 8131 flow [2022-12-13 12:48:20,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:20,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:20,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:20,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 12:48:20,196 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1269229127, now seen corresponding path program 4 times [2022-12-13 12:48:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:20,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301162054] [2022-12-13 12:48:20,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:20,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:20,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301162054] [2022-12-13 12:48:20,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301162054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:20,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:20,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005548016] [2022-12-13 12:48:20,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:20,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:20,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:20,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:20,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 409 transitions, 8131 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:20,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:20,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:20,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:23,069 INFO L130 PetriNetUnfolder]: 11732/17410 cut-off events. [2022-12-13 12:48:23,070 INFO L131 PetriNetUnfolder]: For 209778/209778 co-relation queries the response was YES. [2022-12-13 12:48:23,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98072 conditions, 17410 events. 11732/17410 cut-off events. For 209778/209778 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 111883 event pairs, 4701 based on Foata normal form. 2/16526 useless extension candidates. Maximal degree in co-relation 95779. Up to 13964 conditions per place. [2022-12-13 12:48:23,205 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 387 selfloop transitions, 52 changer transitions 8/448 dead transitions. [2022-12-13 12:48:23,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 448 transitions, 9174 flow [2022-12-13 12:48:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:48:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 12:48:23,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4163265306122449 [2022-12-13 12:48:23,207 INFO L175 Difference]: Start difference. First operand has 172 places, 409 transitions, 8131 flow. Second operand 5 states and 102 transitions. [2022-12-13 12:48:23,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 448 transitions, 9174 flow [2022-12-13 12:48:24,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 448 transitions, 8993 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-13 12:48:24,621 INFO L231 Difference]: Finished difference. Result has 174 places, 402 transitions, 7954 flow [2022-12-13 12:48:24,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7952, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7954, PETRI_PLACES=174, PETRI_TRANSITIONS=402} [2022-12-13 12:48:24,621 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 136 predicate places. [2022-12-13 12:48:24,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:24,621 INFO L89 Accepts]: Start accepts. Operand has 174 places, 402 transitions, 7954 flow [2022-12-13 12:48:24,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:24,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:24,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 402 transitions, 7954 flow [2022-12-13 12:48:24,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 402 transitions, 7954 flow [2022-12-13 12:48:24,915 INFO L130 PetriNetUnfolder]: 855/2252 cut-off events. [2022-12-13 12:48:24,915 INFO L131 PetriNetUnfolder]: For 33114/33785 co-relation queries the response was YES. [2022-12-13 12:48:24,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13206 conditions, 2252 events. 855/2252 cut-off events. For 33114/33785 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 18969 event pairs, 0 based on Foata normal form. 164/2257 useless extension candidates. Maximal degree in co-relation 12831. Up to 504 conditions per place. [2022-12-13 12:48:24,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 402 transitions, 7954 flow [2022-12-13 12:48:24,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 2772 [2022-12-13 12:48:24,955 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:24,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-13 12:48:24,956 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 402 transitions, 7954 flow [2022-12-13 12:48:24,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:24,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:24,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:24,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 12:48:24,956 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1132347268, now seen corresponding path program 1 times [2022-12-13 12:48:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:24,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445190077] [2022-12-13 12:48:24,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:24,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445190077] [2022-12-13 12:48:25,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445190077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:25,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:25,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081044875] [2022-12-13 12:48:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:25,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:25,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:25,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:25,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:25,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 402 transitions, 7954 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:25,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:25,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:25,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:27,129 INFO L130 PetriNetUnfolder]: 10837/16051 cut-off events. [2022-12-13 12:48:27,130 INFO L131 PetriNetUnfolder]: For 197163/197163 co-relation queries the response was YES. [2022-12-13 12:48:27,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91283 conditions, 16051 events. 10837/16051 cut-off events. For 197163/197163 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 100669 event pairs, 1409 based on Foata normal form. 88/15419 useless extension candidates. Maximal degree in co-relation 89622. Up to 9938 conditions per place. [2022-12-13 12:48:27,227 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 382 selfloop transitions, 57 changer transitions 14/454 dead transitions. [2022-12-13 12:48:27,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 454 transitions, 9047 flow [2022-12-13 12:48:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:48:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 12:48:27,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44081632653061226 [2022-12-13 12:48:27,228 INFO L175 Difference]: Start difference. First operand has 174 places, 402 transitions, 7954 flow. Second operand 5 states and 108 transitions. [2022-12-13 12:48:27,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 454 transitions, 9047 flow [2022-12-13 12:48:28,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 454 transitions, 8880 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-13 12:48:28,527 INFO L231 Difference]: Finished difference. Result has 175 places, 379 transitions, 7450 flow [2022-12-13 12:48:28,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7460, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7450, PETRI_PLACES=175, PETRI_TRANSITIONS=379} [2022-12-13 12:48:28,528 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 137 predicate places. [2022-12-13 12:48:28,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:28,528 INFO L89 Accepts]: Start accepts. Operand has 175 places, 379 transitions, 7450 flow [2022-12-13 12:48:28,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:28,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:28,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 379 transitions, 7450 flow [2022-12-13 12:48:28,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 379 transitions, 7450 flow [2022-12-13 12:48:28,761 INFO L130 PetriNetUnfolder]: 766/1951 cut-off events. [2022-12-13 12:48:28,761 INFO L131 PetriNetUnfolder]: For 29874/30426 co-relation queries the response was YES. [2022-12-13 12:48:28,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11786 conditions, 1951 events. 766/1951 cut-off events. For 29874/30426 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 15528 event pairs, 0 based on Foata normal form. 166/1983 useless extension candidates. Maximal degree in co-relation 11415. Up to 430 conditions per place. [2022-12-13 12:48:28,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 379 transitions, 7450 flow [2022-12-13 12:48:28,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 2692 [2022-12-13 12:48:28,804 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:28,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-13 12:48:28,805 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 379 transitions, 7450 flow [2022-12-13 12:48:28,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:28,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:28,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:28,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 12:48:28,805 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1827814052, now seen corresponding path program 2 times [2022-12-13 12:48:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:28,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504028949] [2022-12-13 12:48:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:28,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504028949] [2022-12-13 12:48:28,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504028949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:28,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:28,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899985765] [2022-12-13 12:48:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:28,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:28,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:28,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 379 transitions, 7450 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:28,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:28,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:28,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:31,006 INFO L130 PetriNetUnfolder]: 10343/15277 cut-off events. [2022-12-13 12:48:31,006 INFO L131 PetriNetUnfolder]: For 193565/193565 co-relation queries the response was YES. [2022-12-13 12:48:31,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86436 conditions, 15277 events. 10343/15277 cut-off events. For 193565/193565 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 94480 event pairs, 1693 based on Foata normal form. 144/14715 useless extension candidates. Maximal degree in co-relation 84762. Up to 12024 conditions per place. [2022-12-13 12:48:31,098 INFO L137 encePairwiseOnDemand]: 44/49 looper letters, 349 selfloop transitions, 45 changer transitions 0/395 dead transitions. [2022-12-13 12:48:31,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 395 transitions, 8049 flow [2022-12-13 12:48:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:48:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 12:48:31,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-13 12:48:31,099 INFO L175 Difference]: Start difference. First operand has 175 places, 379 transitions, 7450 flow. Second operand 4 states and 92 transitions. [2022-12-13 12:48:31,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 395 transitions, 8049 flow [2022-12-13 12:48:32,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 395 transitions, 7718 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-13 12:48:32,035 INFO L231 Difference]: Finished difference. Result has 171 places, 366 transitions, 6871 flow [2022-12-13 12:48:32,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6781, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6871, PETRI_PLACES=171, PETRI_TRANSITIONS=366} [2022-12-13 12:48:32,036 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2022-12-13 12:48:32,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:32,036 INFO L89 Accepts]: Start accepts. Operand has 171 places, 366 transitions, 6871 flow [2022-12-13 12:48:32,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:32,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:32,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 366 transitions, 6871 flow [2022-12-13 12:48:32,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 366 transitions, 6871 flow [2022-12-13 12:48:32,281 INFO L130 PetriNetUnfolder]: 739/1855 cut-off events. [2022-12-13 12:48:32,281 INFO L131 PetriNetUnfolder]: For 24752/25144 co-relation queries the response was YES. [2022-12-13 12:48:32,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10958 conditions, 1855 events. 739/1855 cut-off events. For 24752/25144 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 14514 event pairs, 0 based on Foata normal form. 140/1866 useless extension candidates. Maximal degree in co-relation 10588. Up to 400 conditions per place. [2022-12-13 12:48:32,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 366 transitions, 6871 flow [2022-12-13 12:48:32,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 2574 [2022-12-13 12:48:32,314 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:32,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-13 12:48:32,315 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 366 transitions, 6871 flow [2022-12-13 12:48:32,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:48:32,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:32,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:32,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 12:48:32,316 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1271854903, now seen corresponding path program 5 times [2022-12-13 12:48:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:32,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087267651] [2022-12-13 12:48:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:32,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:32,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:32,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087267651] [2022-12-13 12:48:32,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087267651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:32,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:32,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063660026] [2022-12-13 12:48:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:32,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:32,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:32,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:32,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 12:48:32,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 366 transitions, 6871 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:32,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:32,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 12:48:32,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:34,327 INFO L130 PetriNetUnfolder]: 10343/15199 cut-off events. [2022-12-13 12:48:34,327 INFO L131 PetriNetUnfolder]: For 169267/169267 co-relation queries the response was YES. [2022-12-13 12:48:34,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84861 conditions, 15199 events. 10343/15199 cut-off events. For 169267/169267 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 92772 event pairs, 2884 based on Foata normal form. 2/14433 useless extension candidates. Maximal degree in co-relation 83234. Up to 7182 conditions per place. [2022-12-13 12:48:34,414 INFO L137 encePairwiseOnDemand]: 33/48 looper letters, 289 selfloop transitions, 106 changer transitions 18/414 dead transitions. [2022-12-13 12:48:34,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 414 transitions, 7804 flow [2022-12-13 12:48:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:48:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:48:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-12-13 12:48:34,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 12:48:34,415 INFO L175 Difference]: Start difference. First operand has 171 places, 366 transitions, 6871 flow. Second operand 6 states and 124 transitions. [2022-12-13 12:48:34,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 414 transitions, 7804 flow [2022-12-13 12:48:35,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 414 transitions, 7698 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 12:48:35,148 INFO L231 Difference]: Finished difference. Result has 173 places, 358 transitions, 6840 flow [2022-12-13 12:48:35,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6765, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6840, PETRI_PLACES=173, PETRI_TRANSITIONS=358} [2022-12-13 12:48:35,149 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 135 predicate places. [2022-12-13 12:48:35,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:35,150 INFO L89 Accepts]: Start accepts. Operand has 173 places, 358 transitions, 6840 flow [2022-12-13 12:48:35,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:35,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:35,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 358 transitions, 6840 flow [2022-12-13 12:48:35,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 358 transitions, 6840 flow [2022-12-13 12:48:35,306 INFO L130 PetriNetUnfolder]: 728/1805 cut-off events. [2022-12-13 12:48:35,306 INFO L131 PetriNetUnfolder]: For 24978/25371 co-relation queries the response was YES. [2022-12-13 12:48:35,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10959 conditions, 1805 events. 728/1805 cut-off events. For 24978/25371 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 13946 event pairs, 0 based on Foata normal form. 142/1823 useless extension candidates. Maximal degree in co-relation 10853. Up to 387 conditions per place. [2022-12-13 12:48:35,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 358 transitions, 6840 flow [2022-12-13 12:48:35,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 2558 [2022-12-13 12:48:35,348 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:35,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-13 12:48:35,349 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 358 transitions, 6840 flow [2022-12-13 12:48:35,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:35,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:35,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:35,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 12:48:35,349 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1618350287, now seen corresponding path program 6 times [2022-12-13 12:48:35,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:35,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761988393] [2022-12-13 12:48:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:35,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761988393] [2022-12-13 12:48:35,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761988393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:35,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:35,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996009518] [2022-12-13 12:48:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:35,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:35,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:35,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 12:48:35,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 358 transitions, 6840 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:35,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:35,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 12:48:35,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:37,600 INFO L130 PetriNetUnfolder]: 10294/15131 cut-off events. [2022-12-13 12:48:37,601 INFO L131 PetriNetUnfolder]: For 169652/169652 co-relation queries the response was YES. [2022-12-13 12:48:37,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85689 conditions, 15131 events. 10294/15131 cut-off events. For 169652/169652 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 93025 event pairs, 2063 based on Foata normal form. 3/14438 useless extension candidates. Maximal degree in co-relation 85560. Up to 7721 conditions per place. [2022-12-13 12:48:37,698 INFO L137 encePairwiseOnDemand]: 38/48 looper letters, 338 selfloop transitions, 81 changer transitions 17/437 dead transitions. [2022-12-13 12:48:37,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 437 transitions, 8109 flow [2022-12-13 12:48:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:48:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:48:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2022-12-13 12:48:37,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-13 12:48:37,699 INFO L175 Difference]: Start difference. First operand has 172 places, 358 transitions, 6840 flow. Second operand 6 states and 135 transitions. [2022-12-13 12:48:37,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 437 transitions, 8109 flow [2022-12-13 12:48:38,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 437 transitions, 7623 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 12:48:38,545 INFO L231 Difference]: Finished difference. Result has 172 places, 351 transitions, 6444 flow [2022-12-13 12:48:38,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6380, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6444, PETRI_PLACES=172, PETRI_TRANSITIONS=351} [2022-12-13 12:48:38,546 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 134 predicate places. [2022-12-13 12:48:38,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:38,546 INFO L89 Accepts]: Start accepts. Operand has 172 places, 351 transitions, 6444 flow [2022-12-13 12:48:38,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:38,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:38,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 351 transitions, 6444 flow [2022-12-13 12:48:38,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 351 transitions, 6444 flow [2022-12-13 12:48:38,770 INFO L130 PetriNetUnfolder]: 722/1775 cut-off events. [2022-12-13 12:48:38,770 INFO L131 PetriNetUnfolder]: For 23007/23487 co-relation queries the response was YES. [2022-12-13 12:48:38,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10354 conditions, 1775 events. 722/1775 cut-off events. For 23007/23487 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 13609 event pairs, 0 based on Foata normal form. 143/1793 useless extension candidates. Maximal degree in co-relation 10256. Up to 374 conditions per place. [2022-12-13 12:48:38,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 351 transitions, 6444 flow [2022-12-13 12:48:38,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 2524 [2022-12-13 12:48:38,819 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:38,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-13 12:48:38,820 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 351 transitions, 6444 flow [2022-12-13 12:48:38,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:38,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:38,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:38,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 12:48:38,821 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:38,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1460032622, now seen corresponding path program 1 times [2022-12-13 12:48:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:38,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620187191] [2022-12-13 12:48:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:38,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:38,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620187191] [2022-12-13 12:48:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620187191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:38,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:38,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:38,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566660039] [2022-12-13 12:48:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:38,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:38,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 12:48:38,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 351 transitions, 6444 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:38,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:38,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 12:48:38,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:40,701 INFO L130 PetriNetUnfolder]: 9865/14565 cut-off events. [2022-12-13 12:48:40,701 INFO L131 PetriNetUnfolder]: For 164507/164507 co-relation queries the response was YES. [2022-12-13 12:48:40,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78743 conditions, 14565 events. 9865/14565 cut-off events. For 164507/164507 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 89104 event pairs, 3420 based on Foata normal form. 118/13975 useless extension candidates. Maximal degree in co-relation 78622. Up to 10043 conditions per place. [2022-12-13 12:48:40,795 INFO L137 encePairwiseOnDemand]: 43/48 looper letters, 366 selfloop transitions, 26 changer transitions 14/407 dead transitions. [2022-12-13 12:48:40,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 407 transitions, 7340 flow [2022-12-13 12:48:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:48:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-13 12:48:40,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-13 12:48:40,797 INFO L175 Difference]: Start difference. First operand has 169 places, 351 transitions, 6444 flow. Second operand 5 states and 116 transitions. [2022-12-13 12:48:40,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 407 transitions, 7340 flow [2022-12-13 12:48:41,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 407 transitions, 7128 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 12:48:41,403 INFO L231 Difference]: Finished difference. Result has 167 places, 333 transitions, 5918 flow [2022-12-13 12:48:41,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6001, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5918, PETRI_PLACES=167, PETRI_TRANSITIONS=333} [2022-12-13 12:48:41,404 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 129 predicate places. [2022-12-13 12:48:41,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:41,404 INFO L89 Accepts]: Start accepts. Operand has 167 places, 333 transitions, 5918 flow [2022-12-13 12:48:41,405 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:41,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:41,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 333 transitions, 5918 flow [2022-12-13 12:48:41,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 333 transitions, 5918 flow [2022-12-13 12:48:41,645 INFO L130 PetriNetUnfolder]: 674/1648 cut-off events. [2022-12-13 12:48:41,645 INFO L131 PetriNetUnfolder]: For 19597/19936 co-relation queries the response was YES. [2022-12-13 12:48:41,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 1648 events. 674/1648 cut-off events. For 19597/19936 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 12307 event pairs, 0 based on Foata normal form. 120/1656 useless extension candidates. Maximal degree in co-relation 9211. Up to 352 conditions per place. [2022-12-13 12:48:41,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 333 transitions, 5918 flow [2022-12-13 12:48:41,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 2396 [2022-12-13 12:48:41,677 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:41,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-13 12:48:41,677 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 333 transitions, 5918 flow [2022-12-13 12:48:41,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:41,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:41,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:41,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 12:48:41,678 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1554242826, now seen corresponding path program 2 times [2022-12-13 12:48:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:41,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882699871] [2022-12-13 12:48:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:41,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882699871] [2022-12-13 12:48:41,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882699871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:41,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:41,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471655039] [2022-12-13 12:48:41,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:41,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:41,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:41,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 12:48:41,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 333 transitions, 5918 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:41,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:41,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 12:48:41,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:43,252 INFO L130 PetriNetUnfolder]: 9164/13294 cut-off events. [2022-12-13 12:48:43,252 INFO L131 PetriNetUnfolder]: For 137101/137101 co-relation queries the response was YES. [2022-12-13 12:48:43,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72333 conditions, 13294 events. 9164/13294 cut-off events. For 137101/137101 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 76982 event pairs, 3603 based on Foata normal form. 52/12668 useless extension candidates. Maximal degree in co-relation 72180. Up to 10790 conditions per place. [2022-12-13 12:48:43,476 INFO L137 encePairwiseOnDemand]: 43/48 looper letters, 306 selfloop transitions, 25 changer transitions 9/341 dead transitions. [2022-12-13 12:48:43,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 341 transitions, 6123 flow [2022-12-13 12:48:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:48:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 12:48:43,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 12:48:43,478 INFO L175 Difference]: Start difference. First operand has 167 places, 333 transitions, 5918 flow. Second operand 5 states and 104 transitions. [2022-12-13 12:48:43,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 341 transitions, 6123 flow [2022-12-13 12:48:43,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 341 transitions, 6046 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-13 12:48:43,925 INFO L231 Difference]: Finished difference. Result has 157 places, 296 transitions, 5183 flow [2022-12-13 12:48:43,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5280, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5183, PETRI_PLACES=157, PETRI_TRANSITIONS=296} [2022-12-13 12:48:43,925 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 119 predicate places. [2022-12-13 12:48:43,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:43,925 INFO L89 Accepts]: Start accepts. Operand has 157 places, 296 transitions, 5183 flow [2022-12-13 12:48:43,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:43,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:43,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 296 transitions, 5183 flow [2022-12-13 12:48:43,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 296 transitions, 5183 flow [2022-12-13 12:48:44,036 INFO L130 PetriNetUnfolder]: 615/1414 cut-off events. [2022-12-13 12:48:44,036 INFO L131 PetriNetUnfolder]: For 17315/17610 co-relation queries the response was YES. [2022-12-13 12:48:44,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8421 conditions, 1414 events. 615/1414 cut-off events. For 17315/17610 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 9776 event pairs, 0 based on Foata normal form. 99/1423 useless extension candidates. Maximal degree in co-relation 7831. Up to 339 conditions per place. [2022-12-13 12:48:44,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 296 transitions, 5183 flow [2022-12-13 12:48:44,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 2162 [2022-12-13 12:48:44,065 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:44,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 12:48:44,066 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 296 transitions, 5183 flow [2022-12-13 12:48:44,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:44,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:44,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:44,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 12:48:44,066 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1110864162, now seen corresponding path program 3 times [2022-12-13 12:48:44,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:44,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255290578] [2022-12-13 12:48:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255290578] [2022-12-13 12:48:44,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255290578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:44,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:44,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033830125] [2022-12-13 12:48:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:44,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:44,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 12:48:44,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 296 transitions, 5183 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:44,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:44,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 12:48:44,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:45,562 INFO L130 PetriNetUnfolder]: 8520/12370 cut-off events. [2022-12-13 12:48:45,562 INFO L131 PetriNetUnfolder]: For 124231/124231 co-relation queries the response was YES. [2022-12-13 12:48:45,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65803 conditions, 12370 events. 8520/12370 cut-off events. For 124231/124231 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 71053 event pairs, 1617 based on Foata normal form. 124/11898 useless extension candidates. Maximal degree in co-relation 62452. Up to 8713 conditions per place. [2022-12-13 12:48:45,623 INFO L137 encePairwiseOnDemand]: 42/48 looper letters, 257 selfloop transitions, 21 changer transitions 22/301 dead transitions. [2022-12-13 12:48:45,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 301 transitions, 5466 flow [2022-12-13 12:48:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:48:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 12:48:45,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-13 12:48:45,624 INFO L175 Difference]: Start difference. First operand has 156 places, 296 transitions, 5183 flow. Second operand 5 states and 87 transitions. [2022-12-13 12:48:45,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 301 transitions, 5466 flow [2022-12-13 12:48:46,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 301 transitions, 5160 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-12-13 12:48:46,025 INFO L231 Difference]: Finished difference. Result has 147 places, 258 transitions, 4228 flow [2022-12-13 12:48:46,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4228, PETRI_PLACES=147, PETRI_TRANSITIONS=258} [2022-12-13 12:48:46,025 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 109 predicate places. [2022-12-13 12:48:46,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:46,025 INFO L89 Accepts]: Start accepts. Operand has 147 places, 258 transitions, 4228 flow [2022-12-13 12:48:46,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:46,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:46,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 258 transitions, 4228 flow [2022-12-13 12:48:46,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 258 transitions, 4228 flow [2022-12-13 12:48:46,120 INFO L130 PetriNetUnfolder]: 555/1269 cut-off events. [2022-12-13 12:48:46,121 INFO L131 PetriNetUnfolder]: For 14641/14862 co-relation queries the response was YES. [2022-12-13 12:48:46,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7069 conditions, 1269 events. 555/1269 cut-off events. For 14641/14862 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8394 event pairs, 0 based on Foata normal form. 76/1257 useless extension candidates. Maximal degree in co-relation 6345. Up to 300 conditions per place. [2022-12-13 12:48:46,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 258 transitions, 4228 flow [2022-12-13 12:48:46,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 1782 [2022-12-13 12:48:46,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [931] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_11| 0) (not (= v_~count1~0_29 v_~count3~0_41)) (= (ite (< v_~count3~0_41 v_~count1~0_29) 1 (- 1)) v_~res3~0_16) (= v_thread3Thread1of1ForFork2_~stop~2_23 0) (= |v_thread3Thread1of1ForFork2_#res.offset_11| 0)) InVars {~count3~0=v_~count3~0_41, ~count1~0=v_~count1~0_29} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_23, ~count3~0=v_~count3~0_41, ~count1~0=v_~count1~0_29, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_11|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_11|, ~res3~0=v_~res3~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, ~res3~0] and [935] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~stop~0_13 0) (= v_~count1~0_33 v_~count2~0_29) (= v_thread1Thread1of1ForFork0_~i~0_55 0)) InVars {~count2~0=v_~count2~0_29, ~count1~0=v_~count1~0_33} OutVars{~count2~0=v_~count2~0_29, ~count1~0=v_~count1~0_33, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] [2022-12-13 12:48:46,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [931] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_11| 0) (not (= v_~count1~0_29 v_~count3~0_41)) (= (ite (< v_~count3~0_41 v_~count1~0_29) 1 (- 1)) v_~res3~0_16) (= v_thread3Thread1of1ForFork2_~stop~2_23 0) (= |v_thread3Thread1of1ForFork2_#res.offset_11| 0)) InVars {~count3~0=v_~count3~0_41, ~count1~0=v_~count1~0_29} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_23, ~count3~0=v_~count3~0_41, ~count1~0=v_~count1~0_29, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_11|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_11|, ~res3~0=v_~res3~0_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, ~res3~0] and [935] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~stop~0_13 0) (= v_~count1~0_33 v_~count2~0_29) (= v_thread1Thread1of1ForFork0_~i~0_55 0)) InVars {~count2~0=v_~count2~0_29, ~count1~0=v_~count1~0_33} OutVars{~count2~0=v_~count2~0_29, ~count1~0=v_~count1~0_33, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] [2022-12-13 12:48:46,240 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:48:46,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-13 12:48:46,241 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 258 transitions, 4260 flow [2022-12-13 12:48:46,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:46,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:46,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:46,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 12:48:46,242 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2108908612, now seen corresponding path program 1 times [2022-12-13 12:48:46,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:46,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797713961] [2022-12-13 12:48:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797713961] [2022-12-13 12:48:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797713961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:46,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:46,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109017054] [2022-12-13 12:48:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:46,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:46,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:46,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:46,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 258 transitions, 4260 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:46,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:46,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:46,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:47,366 INFO L130 PetriNetUnfolder]: 7252/10334 cut-off events. [2022-12-13 12:48:47,366 INFO L131 PetriNetUnfolder]: For 109167/109167 co-relation queries the response was YES. [2022-12-13 12:48:47,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54042 conditions, 10334 events. 7252/10334 cut-off events. For 109167/109167 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 55355 event pairs, 2691 based on Foata normal form. 132/9882 useless extension candidates. Maximal degree in co-relation 51081. Up to 8306 conditions per place. [2022-12-13 12:48:47,425 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 227 selfloop transitions, 8 changer transitions 30/266 dead transitions. [2022-12-13 12:48:47,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 266 transitions, 4513 flow [2022-12-13 12:48:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:48:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 12:48:47,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2022-12-13 12:48:47,426 INFO L175 Difference]: Start difference. First operand has 141 places, 258 transitions, 4260 flow. Second operand 5 states and 90 transitions. [2022-12-13 12:48:47,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 266 transitions, 4513 flow [2022-12-13 12:48:47,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 266 transitions, 4199 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-12-13 12:48:47,717 INFO L231 Difference]: Finished difference. Result has 132 places, 222 transitions, 3339 flow [2022-12-13 12:48:47,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3606, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3339, PETRI_PLACES=132, PETRI_TRANSITIONS=222} [2022-12-13 12:48:47,718 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2022-12-13 12:48:47,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:47,718 INFO L89 Accepts]: Start accepts. Operand has 132 places, 222 transitions, 3339 flow [2022-12-13 12:48:47,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:47,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:47,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 222 transitions, 3339 flow [2022-12-13 12:48:47,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 222 transitions, 3339 flow [2022-12-13 12:48:47,903 INFO L130 PetriNetUnfolder]: 470/1018 cut-off events. [2022-12-13 12:48:47,903 INFO L131 PetriNetUnfolder]: For 9389/9535 co-relation queries the response was YES. [2022-12-13 12:48:47,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5606 conditions, 1018 events. 470/1018 cut-off events. For 9389/9535 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6071 event pairs, 0 based on Foata normal form. 54/1005 useless extension candidates. Maximal degree in co-relation 5377. Up to 237 conditions per place. [2022-12-13 12:48:47,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 222 transitions, 3339 flow [2022-12-13 12:48:47,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-13 12:48:47,927 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:47,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 12:48:47,929 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 222 transitions, 3339 flow [2022-12-13 12:48:47,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:48:47,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:47,929 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:48:47,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 12:48:47,929 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -884672726, now seen corresponding path program 1 times [2022-12-13 12:48:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:47,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136229985] [2022-12-13 12:48:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:48,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136229985] [2022-12-13 12:48:48,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136229985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:48,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:48,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:48,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942287541] [2022-12-13 12:48:48,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:48,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:48:48,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:48,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:48:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:48:48,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-13 12:48:48,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 222 transitions, 3339 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:48:48,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:48,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-13 12:48:48,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:49,254 INFO L130 PetriNetUnfolder]: 8416/11902 cut-off events. [2022-12-13 12:48:49,254 INFO L131 PetriNetUnfolder]: For 89383/89383 co-relation queries the response was YES. [2022-12-13 12:48:49,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60385 conditions, 11902 events. 8416/11902 cut-off events. For 89383/89383 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 63323 event pairs, 3488 based on Foata normal form. 72/11381 useless extension candidates. Maximal degree in co-relation 57572. Up to 8721 conditions per place. [2022-12-13 12:48:49,318 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 404 selfloop transitions, 18 changer transitions 0/423 dead transitions. [2022-12-13 12:48:49,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 423 transitions, 6808 flow [2022-12-13 12:48:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:48:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:48:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-13 12:48:49,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5130434782608696 [2022-12-13 12:48:49,319 INFO L175 Difference]: Start difference. First operand has 124 places, 222 transitions, 3339 flow. Second operand 5 states and 118 transitions. [2022-12-13 12:48:49,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 423 transitions, 6808 flow [2022-12-13 12:48:49,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 423 transitions, 6316 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-12-13 12:48:49,572 INFO L231 Difference]: Finished difference. Result has 122 places, 233 transitions, 3341 flow [2022-12-13 12:48:49,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3066, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3341, PETRI_PLACES=122, PETRI_TRANSITIONS=233} [2022-12-13 12:48:49,572 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 84 predicate places. [2022-12-13 12:48:49,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:49,573 INFO L89 Accepts]: Start accepts. Operand has 122 places, 233 transitions, 3341 flow [2022-12-13 12:48:49,573 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:49,573 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:49,573 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 233 transitions, 3341 flow [2022-12-13 12:48:49,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 233 transitions, 3341 flow [2022-12-13 12:48:49,659 INFO L130 PetriNetUnfolder]: 527/1251 cut-off events. [2022-12-13 12:48:49,659 INFO L131 PetriNetUnfolder]: For 8639/8852 co-relation queries the response was YES. [2022-12-13 12:48:49,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6192 conditions, 1251 events. 527/1251 cut-off events. For 8639/8852 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8303 event pairs, 0 based on Foata normal form. 53/1258 useless extension candidates. Maximal degree in co-relation 5150. Up to 247 conditions per place. [2022-12-13 12:48:49,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 233 transitions, 3341 flow [2022-12-13 12:48:49,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 1710 [2022-12-13 12:48:57,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:48:57,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8016 [2022-12-13 12:48:57,589 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 233 transitions, 3386 flow [2022-12-13 12:48:57,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:48:57,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:57,590 INFO L214 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] [2022-12-13 12:48:57,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 12:48:57,590 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1403960817, now seen corresponding path program 1 times [2022-12-13 12:48:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:57,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894817018] [2022-12-13 12:48:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:57,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894817018] [2022-12-13 12:48:57,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894817018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:57,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:57,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:57,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166702431] [2022-12-13 12:48:57,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:57,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:57,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:57,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:57,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 12:48:57,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 233 transitions, 3386 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 12:48:57,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:57,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 12:48:57,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:58,438 INFO L130 PetriNetUnfolder]: 5941/8607 cut-off events. [2022-12-13 12:48:58,438 INFO L131 PetriNetUnfolder]: For 50496/50496 co-relation queries the response was YES. [2022-12-13 12:48:58,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44058 conditions, 8607 events. 5941/8607 cut-off events. For 50496/50496 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 45959 event pairs, 2519 based on Foata normal form. 232/8791 useless extension candidates. Maximal degree in co-relation 36447. Up to 7291 conditions per place. [2022-12-13 12:48:58,487 INFO L137 encePairwiseOnDemand]: 44/49 looper letters, 201 selfloop transitions, 0 changer transitions 112/314 dead transitions. [2022-12-13 12:48:58,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 314 transitions, 5105 flow [2022-12-13 12:48:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:48:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 12:48:58,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-13 12:48:58,488 INFO L175 Difference]: Start difference. First operand has 122 places, 233 transitions, 3386 flow. Second operand 4 states and 92 transitions. [2022-12-13 12:48:58,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 314 transitions, 5105 flow [2022-12-13 12:48:58,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 314 transitions, 5039 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 12:48:58,646 INFO L231 Difference]: Finished difference. Result has 124 places, 202 transitions, 2894 flow [2022-12-13 12:48:58,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2910, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2894, PETRI_PLACES=124, PETRI_TRANSITIONS=202} [2022-12-13 12:48:58,647 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2022-12-13 12:48:58,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:58,647 INFO L89 Accepts]: Start accepts. Operand has 124 places, 202 transitions, 2894 flow [2022-12-13 12:48:58,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:58,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:58,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 202 transitions, 2894 flow [2022-12-13 12:48:58,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 202 transitions, 2894 flow [2022-12-13 12:48:58,705 INFO L130 PetriNetUnfolder]: 324/814 cut-off events. [2022-12-13 12:48:58,705 INFO L131 PetriNetUnfolder]: For 5306/5413 co-relation queries the response was YES. [2022-12-13 12:48:58,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 814 events. 324/814 cut-off events. For 5306/5413 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5107 event pairs, 0 based on Foata normal form. 40/825 useless extension candidates. Maximal degree in co-relation 3216. Up to 149 conditions per place. [2022-12-13 12:48:58,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 202 transitions, 2894 flow [2022-12-13 12:48:58,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 1502 [2022-12-13 12:48:58,717 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:58,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 12:48:58,717 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 202 transitions, 2894 flow [2022-12-13 12:48:58,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 12:48:58,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:58,718 INFO L214 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] [2022-12-13 12:48:58,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 12:48:58,718 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2127086243, now seen corresponding path program 1 times [2022-12-13 12:48:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:58,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805959477] [2022-12-13 12:48:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:58,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805959477] [2022-12-13 12:48:58,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805959477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:58,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:58,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:48:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465053020] [2022-12-13 12:48:58,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:58,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:58,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:58,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 12:48:58,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 202 transitions, 2894 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-13 12:48:58,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:58,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 12:48:58,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:59,355 INFO L130 PetriNetUnfolder]: 3425/4929 cut-off events. [2022-12-13 12:48:59,355 INFO L131 PetriNetUnfolder]: For 30860/30860 co-relation queries the response was YES. [2022-12-13 12:48:59,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26056 conditions, 4929 events. 3425/4929 cut-off events. For 30860/30860 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22219 event pairs, 1412 based on Foata normal form. 252/5018 useless extension candidates. Maximal degree in co-relation 23447. Up to 3568 conditions per place. [2022-12-13 12:48:59,374 INFO L137 encePairwiseOnDemand]: 40/46 looper letters, 130 selfloop transitions, 0 changer transitions 99/229 dead transitions. [2022-12-13 12:48:59,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 229 transitions, 3464 flow [2022-12-13 12:48:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:48:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 12:48:59,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-13 12:48:59,375 INFO L175 Difference]: Start difference. First operand has 119 places, 202 transitions, 2894 flow. Second operand 4 states and 88 transitions. [2022-12-13 12:48:59,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 229 transitions, 3464 flow [2022-12-13 12:48:59,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 229 transitions, 3386 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 12:48:59,465 INFO L231 Difference]: Finished difference. Result has 121 places, 130 transitions, 1644 flow [2022-12-13 12:48:59,465 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2161, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1644, PETRI_PLACES=121, PETRI_TRANSITIONS=130} [2022-12-13 12:48:59,466 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-13 12:48:59,466 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:48:59,466 INFO L89 Accepts]: Start accepts. Operand has 121 places, 130 transitions, 1644 flow [2022-12-13 12:48:59,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:48:59,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:48:59,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 130 transitions, 1644 flow [2022-12-13 12:48:59,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 130 transitions, 1644 flow [2022-12-13 12:48:59,498 INFO L130 PetriNetUnfolder]: 121/323 cut-off events. [2022-12-13 12:48:59,498 INFO L131 PetriNetUnfolder]: For 1680/1721 co-relation queries the response was YES. [2022-12-13 12:48:59,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 323 events. 121/323 cut-off events. For 1680/1721 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1584 event pairs, 0 based on Foata normal form. 13/323 useless extension candidates. Maximal degree in co-relation 1440. Up to 54 conditions per place. [2022-12-13 12:48:59,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 130 transitions, 1644 flow [2022-12-13 12:48:59,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 1018 [2022-12-13 12:48:59,504 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:48:59,505 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 12:48:59,505 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 130 transitions, 1644 flow [2022-12-13 12:48:59,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-13 12:48:59,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:48:59,505 INFO L214 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] [2022-12-13 12:48:59,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 12:48:59,505 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:48:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:48:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash 817335731, now seen corresponding path program 1 times [2022-12-13 12:48:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:48:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534485506] [2022-12-13 12:48:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:48:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:48:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:48:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:48:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:48:59,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534485506] [2022-12-13 12:48:59,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534485506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:48:59,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:48:59,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:48:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784659328] [2022-12-13 12:48:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:48:59,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:48:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:48:59,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:48:59,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:48:59,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 12:48:59,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 130 transitions, 1644 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:48:59,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:48:59,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 12:48:59,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:48:59,951 INFO L130 PetriNetUnfolder]: 2044/2955 cut-off events. [2022-12-13 12:48:59,952 INFO L131 PetriNetUnfolder]: For 15689/15689 co-relation queries the response was YES. [2022-12-13 12:48:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14359 conditions, 2955 events. 2044/2955 cut-off events. For 15689/15689 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13186 event pairs, 228 based on Foata normal form. 100/3052 useless extension candidates. Maximal degree in co-relation 14326. Up to 1811 conditions per place. [2022-12-13 12:48:59,965 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 140 selfloop transitions, 14 changer transitions 0/155 dead transitions. [2022-12-13 12:48:59,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 155 transitions, 1997 flow [2022-12-13 12:48:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:48:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:48:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 12:48:59,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-13 12:48:59,966 INFO L175 Difference]: Start difference. First operand has 113 places, 130 transitions, 1644 flow. Second operand 4 states and 81 transitions. [2022-12-13 12:48:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 155 transitions, 1997 flow [2022-12-13 12:49:00,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 155 transitions, 1895 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-12-13 12:49:00,002 INFO L231 Difference]: Finished difference. Result has 108 places, 126 transitions, 1515 flow [2022-12-13 12:49:00,002 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1515, PETRI_PLACES=108, PETRI_TRANSITIONS=126} [2022-12-13 12:49:00,002 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 70 predicate places. [2022-12-13 12:49:00,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:00,002 INFO L89 Accepts]: Start accepts. Operand has 108 places, 126 transitions, 1515 flow [2022-12-13 12:49:00,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:00,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:00,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 126 transitions, 1515 flow [2022-12-13 12:49:00,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 126 transitions, 1515 flow [2022-12-13 12:49:00,025 INFO L130 PetriNetUnfolder]: 114/319 cut-off events. [2022-12-13 12:49:00,025 INFO L131 PetriNetUnfolder]: For 1413/1454 co-relation queries the response was YES. [2022-12-13 12:49:00,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 319 events. 114/319 cut-off events. For 1413/1454 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1613 event pairs, 0 based on Foata normal form. 14/321 useless extension candidates. Maximal degree in co-relation 1313. Up to 54 conditions per place. [2022-12-13 12:49:00,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 126 transitions, 1515 flow [2022-12-13 12:49:00,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 962 [2022-12-13 12:49:00,029 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:00,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 12:49:00,030 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 126 transitions, 1515 flow [2022-12-13 12:49:00,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:49:00,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:00,030 INFO L214 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] [2022-12-13 12:49:00,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 12:49:00,030 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 391691960, now seen corresponding path program 1 times [2022-12-13 12:49:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:00,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428249463] [2022-12-13 12:49:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:49:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:00,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428249463] [2022-12-13 12:49:00,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428249463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:00,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:00,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:49:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260950020] [2022-12-13 12:49:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:00,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:49:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:49:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:49:00,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 12:49:00,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 126 transitions, 1515 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:49:00,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:00,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 12:49:00,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:00,654 INFO L130 PetriNetUnfolder]: 3844/5524 cut-off events. [2022-12-13 12:49:00,654 INFO L131 PetriNetUnfolder]: For 26295/26295 co-relation queries the response was YES. [2022-12-13 12:49:00,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26315 conditions, 5524 events. 3844/5524 cut-off events. For 26295/26295 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27099 event pairs, 1277 based on Foata normal form. 3/5503 useless extension candidates. Maximal degree in co-relation 20941. Up to 2002 conditions per place. [2022-12-13 12:49:00,675 INFO L137 encePairwiseOnDemand]: 29/42 looper letters, 185 selfloop transitions, 71 changer transitions 3/260 dead transitions. [2022-12-13 12:49:00,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 260 transitions, 3541 flow [2022-12-13 12:49:00,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:49:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:49:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-13 12:49:00,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-13 12:49:00,676 INFO L175 Difference]: Start difference. First operand has 108 places, 126 transitions, 1515 flow. Second operand 4 states and 104 transitions. [2022-12-13 12:49:00,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 260 transitions, 3541 flow [2022-12-13 12:49:00,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 260 transitions, 3529 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:49:00,711 INFO L231 Difference]: Finished difference. Result has 112 places, 179 transitions, 2571 flow [2022-12-13 12:49:00,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2571, PETRI_PLACES=112, PETRI_TRANSITIONS=179} [2022-12-13 12:49:00,711 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 74 predicate places. [2022-12-13 12:49:00,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:00,711 INFO L89 Accepts]: Start accepts. Operand has 112 places, 179 transitions, 2571 flow [2022-12-13 12:49:00,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:00,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:00,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 179 transitions, 2571 flow [2022-12-13 12:49:00,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 179 transitions, 2571 flow [2022-12-13 12:49:00,750 INFO L130 PetriNetUnfolder]: 216/517 cut-off events. [2022-12-13 12:49:00,750 INFO L131 PetriNetUnfolder]: For 3377/3487 co-relation queries the response was YES. [2022-12-13 12:49:00,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 517 events. 216/517 cut-off events. For 3377/3487 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2732 event pairs, 0 based on Foata normal form. 49/544 useless extension candidates. Maximal degree in co-relation 2060. Up to 130 conditions per place. [2022-12-13 12:49:00,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 179 transitions, 2571 flow [2022-12-13 12:49:00,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 1406 [2022-12-13 12:49:00,758 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:00,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 12:49:00,759 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 179 transitions, 2571 flow [2022-12-13 12:49:00,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:49:00,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:00,759 INFO L214 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] [2022-12-13 12:49:00,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 12:49:00,759 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash 352028009, now seen corresponding path program 1 times [2022-12-13 12:49:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:00,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786843920] [2022-12-13 12:49:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:00,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:00,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786843920] [2022-12-13 12:49:00,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786843920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:00,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:00,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:49:00,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476921037] [2022-12-13 12:49:00,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:00,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:49:00,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:00,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:49:00,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:49:00,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 12:49:00,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 179 transitions, 2571 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:49:00,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:00,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 12:49:00,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:01,423 INFO L130 PetriNetUnfolder]: 3922/5611 cut-off events. [2022-12-13 12:49:01,423 INFO L131 PetriNetUnfolder]: For 31803/31803 co-relation queries the response was YES. [2022-12-13 12:49:01,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28830 conditions, 5611 events. 3922/5611 cut-off events. For 31803/31803 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27442 event pairs, 1586 based on Foata normal form. 3/5592 useless extension candidates. Maximal degree in co-relation 22725. Up to 2499 conditions per place. [2022-12-13 12:49:01,448 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 172 selfloop transitions, 41 changer transitions 45/259 dead transitions. [2022-12-13 12:49:01,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 259 transitions, 3869 flow [2022-12-13 12:49:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:49:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:49:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-13 12:49:01,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5773809523809523 [2022-12-13 12:49:01,449 INFO L175 Difference]: Start difference. First operand has 112 places, 179 transitions, 2571 flow. Second operand 4 states and 97 transitions. [2022-12-13 12:49:01,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 259 transitions, 3869 flow [2022-12-13 12:49:01,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 259 transitions, 3807 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 12:49:01,494 INFO L231 Difference]: Finished difference. Result has 115 places, 154 transitions, 2215 flow [2022-12-13 12:49:01,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2509, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2215, PETRI_PLACES=115, PETRI_TRANSITIONS=154} [2022-12-13 12:49:01,495 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2022-12-13 12:49:01,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:01,495 INFO L89 Accepts]: Start accepts. Operand has 115 places, 154 transitions, 2215 flow [2022-12-13 12:49:01,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:01,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:01,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 154 transitions, 2215 flow [2022-12-13 12:49:01,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 154 transitions, 2215 flow [2022-12-13 12:49:01,529 INFO L130 PetriNetUnfolder]: 183/467 cut-off events. [2022-12-13 12:49:01,529 INFO L131 PetriNetUnfolder]: For 3337/3411 co-relation queries the response was YES. [2022-12-13 12:49:01,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 467 events. 183/467 cut-off events. For 3337/3411 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2482 event pairs, 0 based on Foata normal form. 28/474 useless extension candidates. Maximal degree in co-relation 2016. Up to 103 conditions per place. [2022-12-13 12:49:01,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 154 transitions, 2215 flow [2022-12-13 12:49:01,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 1192 [2022-12-13 12:49:01,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:01,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 12:49:01,536 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 154 transitions, 2215 flow [2022-12-13 12:49:01,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-13 12:49:01,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:01,537 INFO L214 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] [2022-12-13 12:49:01,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 12:49:01,537 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 979840062, now seen corresponding path program 1 times [2022-12-13 12:49:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:01,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248942538] [2022-12-13 12:49:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:01,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:01,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248942538] [2022-12-13 12:49:01,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248942538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:01,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:01,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:49:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216402042] [2022-12-13 12:49:01,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:01,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:49:01,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:01,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:49:01,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:49:01,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 12:49:01,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 154 transitions, 2215 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-12-13 12:49:01,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:01,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 12:49:01,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:02,731 INFO L130 PetriNetUnfolder]: 6771/9689 cut-off events. [2022-12-13 12:49:02,732 INFO L131 PetriNetUnfolder]: For 58848/58848 co-relation queries the response was YES. [2022-12-13 12:49:02,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50297 conditions, 9689 events. 6771/9689 cut-off events. For 58848/58848 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 51643 event pairs, 3040 based on Foata normal form. 286/9935 useless extension candidates. Maximal degree in co-relation 42926. Up to 4941 conditions per place. [2022-12-13 12:49:02,800 INFO L137 encePairwiseOnDemand]: 29/42 looper letters, 203 selfloop transitions, 6 changer transitions 117/327 dead transitions. [2022-12-13 12:49:02,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 327 transitions, 5108 flow [2022-12-13 12:49:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:49:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:49:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-13 12:49:02,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2022-12-13 12:49:02,802 INFO L175 Difference]: Start difference. First operand has 115 places, 154 transitions, 2215 flow. Second operand 7 states and 121 transitions. [2022-12-13 12:49:02,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 327 transitions, 5108 flow [2022-12-13 12:49:02,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 327 transitions, 4826 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-12-13 12:49:02,922 INFO L231 Difference]: Finished difference. Result has 121 places, 156 transitions, 2186 flow [2022-12-13 12:49:02,922 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2077, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2186, PETRI_PLACES=121, PETRI_TRANSITIONS=156} [2022-12-13 12:49:02,922 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-13 12:49:02,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:02,923 INFO L89 Accepts]: Start accepts. Operand has 121 places, 156 transitions, 2186 flow [2022-12-13 12:49:02,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:02,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:02,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 156 transitions, 2186 flow [2022-12-13 12:49:02,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 156 transitions, 2186 flow [2022-12-13 12:49:02,972 INFO L130 PetriNetUnfolder]: 242/656 cut-off events. [2022-12-13 12:49:02,972 INFO L131 PetriNetUnfolder]: For 4603/4703 co-relation queries the response was YES. [2022-12-13 12:49:02,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3072 conditions, 656 events. 242/656 cut-off events. For 4603/4703 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3959 event pairs, 0 based on Foata normal form. 44/679 useless extension candidates. Maximal degree in co-relation 3024. Up to 137 conditions per place. [2022-12-13 12:49:02,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 156 transitions, 2186 flow [2022-12-13 12:49:02,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 1192 [2022-12-13 12:49:02,980 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:02,981 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 12:49:02,981 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 156 transitions, 2186 flow [2022-12-13 12:49:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-12-13 12:49:02,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:02,981 INFO L214 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] [2022-12-13 12:49:02,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 12:49:02,981 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 139123211, now seen corresponding path program 1 times [2022-12-13 12:49:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35600745] [2022-12-13 12:49:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:03,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:03,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35600745] [2022-12-13 12:49:03,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35600745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:03,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:03,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:49:03,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516892543] [2022-12-13 12:49:03,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:03,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:49:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:49:03,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:49:03,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 12:49:03,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 156 transitions, 2186 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 12:49:03,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:03,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 12:49:03,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:03,606 INFO L130 PetriNetUnfolder]: 4625/6799 cut-off events. [2022-12-13 12:49:03,606 INFO L131 PetriNetUnfolder]: For 44123/44123 co-relation queries the response was YES. [2022-12-13 12:49:03,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31662 conditions, 6799 events. 4625/6799 cut-off events. For 44123/44123 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35771 event pairs, 508 based on Foata normal form. 328/7125 useless extension candidates. Maximal degree in co-relation 31615. Up to 3938 conditions per place. [2022-12-13 12:49:03,763 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 160 selfloop transitions, 13 changer transitions 1/175 dead transitions. [2022-12-13 12:49:03,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 175 transitions, 2509 flow [2022-12-13 12:49:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:49:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:49:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 12:49:03,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2022-12-13 12:49:03,764 INFO L175 Difference]: Start difference. First operand has 119 places, 156 transitions, 2186 flow. Second operand 4 states and 79 transitions. [2022-12-13 12:49:03,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 175 transitions, 2509 flow [2022-12-13 12:49:03,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 175 transitions, 2190 flow, removed 32 selfloop flow, removed 10 redundant places. [2022-12-13 12:49:03,834 INFO L231 Difference]: Finished difference. Result has 104 places, 140 transitions, 1721 flow [2022-12-13 12:49:03,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1721, PETRI_PLACES=104, PETRI_TRANSITIONS=140} [2022-12-13 12:49:03,834 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-13 12:49:03,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:03,834 INFO L89 Accepts]: Start accepts. Operand has 104 places, 140 transitions, 1721 flow [2022-12-13 12:49:03,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:03,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:03,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 140 transitions, 1721 flow [2022-12-13 12:49:03,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 140 transitions, 1721 flow [2022-12-13 12:49:03,870 INFO L130 PetriNetUnfolder]: 166/426 cut-off events. [2022-12-13 12:49:03,870 INFO L131 PetriNetUnfolder]: For 2998/3058 co-relation queries the response was YES. [2022-12-13 12:49:03,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 426 events. 166/426 cut-off events. For 2998/3058 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2148 event pairs, 0 based on Foata normal form. 19/429 useless extension candidates. Maximal degree in co-relation 1323. Up to 68 conditions per place. [2022-12-13 12:49:03,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 140 transitions, 1721 flow [2022-12-13 12:49:03,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 12:49:04,337 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:49:04,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 504 [2022-12-13 12:49:04,338 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 139 transitions, 1719 flow [2022-12-13 12:49:04,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12-13 12:49:04,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:04,338 INFO L214 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] [2022-12-13 12:49:04,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 12:49:04,338 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1131889630, now seen corresponding path program 1 times [2022-12-13 12:49:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:04,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662705218] [2022-12-13 12:49:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:04,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662705218] [2022-12-13 12:49:04,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662705218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:04,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:04,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:49:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059719298] [2022-12-13 12:49:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:04,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:49:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:49:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:49:04,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 12:49:04,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 139 transitions, 1719 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:49:04,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:04,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 12:49:04,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:05,117 INFO L130 PetriNetUnfolder]: 6425/9131 cut-off events. [2022-12-13 12:49:05,117 INFO L131 PetriNetUnfolder]: For 60077/60077 co-relation queries the response was YES. [2022-12-13 12:49:05,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36599 conditions, 9131 events. 6425/9131 cut-off events. For 60077/60077 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 45581 event pairs, 2160 based on Foata normal form. 264/8945 useless extension candidates. Maximal degree in co-relation 31451. Up to 5106 conditions per place. [2022-12-13 12:49:05,164 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 203 selfloop transitions, 15 changer transitions 0/218 dead transitions. [2022-12-13 12:49:05,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 218 transitions, 3052 flow [2022-12-13 12:49:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:49:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:49:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-13 12:49:05,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3380952380952381 [2022-12-13 12:49:05,165 INFO L175 Difference]: Start difference. First operand has 102 places, 139 transitions, 1719 flow. Second operand 5 states and 71 transitions. [2022-12-13 12:49:05,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 218 transitions, 3052 flow [2022-12-13 12:49:05,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 218 transitions, 2984 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-13 12:49:05,257 INFO L231 Difference]: Finished difference. Result has 104 places, 140 transitions, 1754 flow [2022-12-13 12:49:05,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1754, PETRI_PLACES=104, PETRI_TRANSITIONS=140} [2022-12-13 12:49:05,257 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-13 12:49:05,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:05,257 INFO L89 Accepts]: Start accepts. Operand has 104 places, 140 transitions, 1754 flow [2022-12-13 12:49:05,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:05,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:05,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 140 transitions, 1754 flow [2022-12-13 12:49:05,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 140 transitions, 1754 flow [2022-12-13 12:49:05,302 INFO L130 PetriNetUnfolder]: 216/594 cut-off events. [2022-12-13 12:49:05,302 INFO L131 PetriNetUnfolder]: For 4215/4312 co-relation queries the response was YES. [2022-12-13 12:49:05,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 594 events. 216/594 cut-off events. For 4215/4312 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3518 event pairs, 0 based on Foata normal form. 27/596 useless extension candidates. Maximal degree in co-relation 1863. Up to 95 conditions per place. [2022-12-13 12:49:05,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 140 transitions, 1754 flow [2022-12-13 12:49:05,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-13 12:49:05,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:05,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 12:49:05,312 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 140 transitions, 1754 flow [2022-12-13 12:49:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:49:05,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:05,313 INFO L214 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] [2022-12-13 12:49:05,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 12:49:05,313 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2127382598, now seen corresponding path program 1 times [2022-12-13 12:49:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:05,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278304432] [2022-12-13 12:49:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278304432] [2022-12-13 12:49:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278304432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:05,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:49:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74599994] [2022-12-13 12:49:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:49:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:49:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:49:05,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 12:49:05,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 140 transitions, 1754 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-13 12:49:05,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:05,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 12:49:05,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:06,875 INFO L130 PetriNetUnfolder]: 10644/15500 cut-off events. [2022-12-13 12:49:06,875 INFO L131 PetriNetUnfolder]: For 84439/84439 co-relation queries the response was YES. [2022-12-13 12:49:06,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62419 conditions, 15500 events. 10644/15500 cut-off events. For 84439/84439 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 90469 event pairs, 4818 based on Foata normal form. 6/15453 useless extension candidates. Maximal degree in co-relation 55224. Up to 6052 conditions per place. [2022-12-13 12:49:06,972 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 221 selfloop transitions, 59 changer transitions 39/320 dead transitions. [2022-12-13 12:49:06,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 320 transitions, 4448 flow [2022-12-13 12:49:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:49:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:49:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-12-13 12:49:06,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-13 12:49:06,973 INFO L175 Difference]: Start difference. First operand has 104 places, 140 transitions, 1754 flow. Second operand 6 states and 124 transitions. [2022-12-13 12:49:06,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 320 transitions, 4448 flow [2022-12-13 12:49:07,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 320 transitions, 4405 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:49:07,188 INFO L231 Difference]: Finished difference. Result has 109 places, 163 transitions, 2176 flow [2022-12-13 12:49:07,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2176, PETRI_PLACES=109, PETRI_TRANSITIONS=163} [2022-12-13 12:49:07,188 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 71 predicate places. [2022-12-13 12:49:07,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:07,189 INFO L89 Accepts]: Start accepts. Operand has 109 places, 163 transitions, 2176 flow [2022-12-13 12:49:07,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:07,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:07,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 163 transitions, 2176 flow [2022-12-13 12:49:07,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 163 transitions, 2176 flow [2022-12-13 12:49:07,277 INFO L130 PetriNetUnfolder]: 370/1000 cut-off events. [2022-12-13 12:49:07,277 INFO L131 PetriNetUnfolder]: For 7303/7454 co-relation queries the response was YES. [2022-12-13 12:49:07,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4131 conditions, 1000 events. 370/1000 cut-off events. For 7303/7454 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6827 event pairs, 0 based on Foata normal form. 43/1002 useless extension candidates. Maximal degree in co-relation 3352. Up to 161 conditions per place. [2022-12-13 12:49:07,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 163 transitions, 2176 flow [2022-12-13 12:49:07,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 1268 [2022-12-13 12:49:17,215 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:49:17,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10027 [2022-12-13 12:49:17,216 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 163 transitions, 2217 flow [2022-12-13 12:49:17,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-13 12:49:17,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:17,216 INFO L214 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] [2022-12-13 12:49:17,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 12:49:17,216 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1782619768, now seen corresponding path program 1 times [2022-12-13 12:49:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:17,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228963105] [2022-12-13 12:49:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:18,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:18,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228963105] [2022-12-13 12:49:18,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228963105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:18,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:18,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:49:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772242307] [2022-12-13 12:49:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:18,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:49:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:18,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:49:18,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:49:18,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 12:49:18,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 163 transitions, 2217 flow. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:49:18,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:18,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 12:49:18,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:20,714 INFO L130 PetriNetUnfolder]: 14449/20370 cut-off events. [2022-12-13 12:49:20,715 INFO L131 PetriNetUnfolder]: For 119108/119108 co-relation queries the response was YES. [2022-12-13 12:49:20,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81415 conditions, 20370 events. 14449/20370 cut-off events. For 119108/119108 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 114500 event pairs, 3959 based on Foata normal form. 1/20367 useless extension candidates. Maximal degree in co-relation 73613. Up to 9592 conditions per place. [2022-12-13 12:49:20,827 INFO L137 encePairwiseOnDemand]: 21/45 looper letters, 343 selfloop transitions, 61 changer transitions 27/431 dead transitions. [2022-12-13 12:49:20,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 431 transitions, 5946 flow [2022-12-13 12:49:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:49:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:49:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 171 transitions. [2022-12-13 12:49:20,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2923076923076923 [2022-12-13 12:49:20,828 INFO L175 Difference]: Start difference. First operand has 109 places, 163 transitions, 2217 flow. Second operand 13 states and 171 transitions. [2022-12-13 12:49:20,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 431 transitions, 5946 flow [2022-12-13 12:49:20,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 431 transitions, 5619 flow, removed 49 selfloop flow, removed 2 redundant places. [2022-12-13 12:49:21,000 INFO L231 Difference]: Finished difference. Result has 128 places, 207 transitions, 2838 flow [2022-12-13 12:49:21,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2838, PETRI_PLACES=128, PETRI_TRANSITIONS=207} [2022-12-13 12:49:21,000 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2022-12-13 12:49:21,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:21,000 INFO L89 Accepts]: Start accepts. Operand has 128 places, 207 transitions, 2838 flow [2022-12-13 12:49:21,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:21,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:21,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 207 transitions, 2838 flow [2022-12-13 12:49:21,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 207 transitions, 2838 flow [2022-12-13 12:49:21,351 INFO L130 PetriNetUnfolder]: 1354/2890 cut-off events. [2022-12-13 12:49:21,351 INFO L131 PetriNetUnfolder]: For 29678/30267 co-relation queries the response was YES. [2022-12-13 12:49:21,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12824 conditions, 2890 events. 1354/2890 cut-off events. For 29678/30267 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 22592 event pairs, 153 based on Foata normal form. 80/2839 useless extension candidates. Maximal degree in co-relation 12767. Up to 585 conditions per place. [2022-12-13 12:49:21,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 207 transitions, 2838 flow [2022-12-13 12:49:21,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 1734 [2022-12-13 12:49:21,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [917] L50-3-->L51-1: Formula: (= (select (select |v_#memory_int_124| v_~get1~0.base_23) (+ v_~get1~0.offset_23 (* v_thread1Thread1of1ForFork0_~i~0_53 4))) |v_thread1Thread1of1ForFork0_#t~mem4_11|) InVars {#memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_11|, #memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4] and [1060] L89-6-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork0_~stop~0_49 1) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.offset_23| 0)) (.cse1 (= (mod v_thread3Thread1of1ForFork2_~stop~2_57 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.base_23| 0))) (or (and .cse0 .cse1 (= (+ v_~res3~0_70 v_~n3~0_100) v_~n1~0_106) .cse2) (and .cse0 (not .cse1) (= v_~res3~0_72 v_~res3~0_70) .cse2))) (= |v_thread1Thread1of1ForFork0_#res.base_25| 0) (= (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_50| (select (select |v_#memory_int_330| v_~get2~0.base_93) (+ v_~get2~0.offset_93 (* v_thread1Thread1of1ForFork0_~i~0_93 4)))) (- 1) 1) v_~res1~0_72) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n3~0_100)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n1~0_106))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_58 v_thread3Thread1of1ForFork2_~stop~2_57) (= |v_thread3Thread1of1ForFork2_#t~mem14_49| |v_thread3Thread1of1ForFork2_#t~mem14_50|) (= |v_thread3Thread1of1ForFork2_#t~mem15_45| |v_thread3Thread1of1ForFork2_#t~mem15_46|) (= |v_thread3Thread1of1ForFork2_#t~mem13_65| |v_thread3Thread1of1ForFork2_#t~mem13_66|) (= v_~res3~0_72 v_~res3~0_71) (= |v_thread3Thread1of1ForFork2_#t~mem12_64| |v_thread3Thread1of1ForFork2_#t~mem12_63|) (or (not .cse3) (not .cse4))) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_63 4))) (let ((.cse6 (select (select |v_#memory_int_330| v_~get3~0.base_93) (+ v_~get3~0.offset_93 .cse7))) (.cse5 (select (select |v_#memory_int_330| v_~get1~0.base_89) (+ v_~get1~0.offset_89 .cse7)))) (and (= (ite (< .cse5 .cse6) (- 1) 1) v_~res3~0_72) .cse4 .cse3 (= v_thread3Thread1of1ForFork2_~stop~2_57 1) (not (= .cse6 .cse5))))))) (= |v_thread1Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_66|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_64|, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, ~get3~0.offset=v_~get3~0.offset_93, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_46|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_50|, ~get1~0.base=v_~get1~0.base_89, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_58, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_50|, ~get2~0.offset=v_~get2~0.offset_93, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_71} OutVars{~res1~0=v_~res1~0_72, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_23|, ~get3~0.offset=v_~get3~0.offset_93, ~get1~0.base=v_~get1~0.base_89, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_33|, ~get2~0.offset=v_~get2~0.offset_93, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_49, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_65|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_63|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_25|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_23|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_25|, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_45|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_49|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_57, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_70} AuxVars[v_~res3~0_72] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_~stop~0, ~res3~0] [2022-12-13 12:49:21,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [917] L50-3-->L51-1: Formula: (= (select (select |v_#memory_int_124| v_~get1~0.base_23) (+ v_~get1~0.offset_23 (* v_thread1Thread1of1ForFork0_~i~0_53 4))) |v_thread1Thread1of1ForFork0_#t~mem4_11|) InVars {#memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_11|, #memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4] and [954] L70-2-->L71-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#t~mem9_21| (select (select |v_#memory_int_160| v_~get2~0.base_45) (+ v_~get2~0.offset_45 (* v_thread2Thread1of1ForFork1_~i~1_49 4)))) (not (= |v_thread2Thread1of1ForFork1_#t~mem8_24| |v_thread2Thread1of1ForFork1_#t~mem7_24|))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_24|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_49, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_24|, ~get2~0.offset=v_~get2~0.offset_45, #memory_int=|v_#memory_int_160|, ~get2~0.base=v_~get2~0.base_45} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_49, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_21|, ~get2~0.offset=v_~get2~0.offset_45, #memory_int=|v_#memory_int_160|, ~get2~0.base=v_~get2~0.base_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~mem9] [2022-12-13 12:49:21,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [917] L50-3-->L51-1: Formula: (= (select (select |v_#memory_int_124| v_~get1~0.base_23) (+ v_~get1~0.offset_23 (* v_thread1Thread1of1ForFork0_~i~0_53 4))) |v_thread1Thread1of1ForFork0_#t~mem4_11|) InVars {#memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_11|, #memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4] and [1060] L89-6-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork0_~stop~0_49 1) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.offset_23| 0)) (.cse1 (= (mod v_thread3Thread1of1ForFork2_~stop~2_57 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.base_23| 0))) (or (and .cse0 .cse1 (= (+ v_~res3~0_70 v_~n3~0_100) v_~n1~0_106) .cse2) (and .cse0 (not .cse1) (= v_~res3~0_72 v_~res3~0_70) .cse2))) (= |v_thread1Thread1of1ForFork0_#res.base_25| 0) (= (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_50| (select (select |v_#memory_int_330| v_~get2~0.base_93) (+ v_~get2~0.offset_93 (* v_thread1Thread1of1ForFork0_~i~0_93 4)))) (- 1) 1) v_~res1~0_72) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n3~0_100)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n1~0_106))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_58 v_thread3Thread1of1ForFork2_~stop~2_57) (= |v_thread3Thread1of1ForFork2_#t~mem14_49| |v_thread3Thread1of1ForFork2_#t~mem14_50|) (= |v_thread3Thread1of1ForFork2_#t~mem15_45| |v_thread3Thread1of1ForFork2_#t~mem15_46|) (= |v_thread3Thread1of1ForFork2_#t~mem13_65| |v_thread3Thread1of1ForFork2_#t~mem13_66|) (= v_~res3~0_72 v_~res3~0_71) (= |v_thread3Thread1of1ForFork2_#t~mem12_64| |v_thread3Thread1of1ForFork2_#t~mem12_63|) (or (not .cse3) (not .cse4))) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_63 4))) (let ((.cse6 (select (select |v_#memory_int_330| v_~get3~0.base_93) (+ v_~get3~0.offset_93 .cse7))) (.cse5 (select (select |v_#memory_int_330| v_~get1~0.base_89) (+ v_~get1~0.offset_89 .cse7)))) (and (= (ite (< .cse5 .cse6) (- 1) 1) v_~res3~0_72) .cse4 .cse3 (= v_thread3Thread1of1ForFork2_~stop~2_57 1) (not (= .cse6 .cse5))))))) (= |v_thread1Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_66|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_64|, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, ~get3~0.offset=v_~get3~0.offset_93, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_46|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_50|, ~get1~0.base=v_~get1~0.base_89, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_58, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_50|, ~get2~0.offset=v_~get2~0.offset_93, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_71} OutVars{~res1~0=v_~res1~0_72, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_23|, ~get3~0.offset=v_~get3~0.offset_93, ~get1~0.base=v_~get1~0.base_89, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_33|, ~get2~0.offset=v_~get2~0.offset_93, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_49, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_65|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_63|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_25|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_23|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_25|, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_45|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_49|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_57, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_70} AuxVars[v_~res3~0_72] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_~stop~0, ~res3~0] [2022-12-13 12:49:21,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [917] L50-3-->L51-1: Formula: (= (select (select |v_#memory_int_124| v_~get1~0.base_23) (+ v_~get1~0.offset_23 (* v_thread1Thread1of1ForFork0_~i~0_53 4))) |v_thread1Thread1of1ForFork0_#t~mem4_11|) InVars {#memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_11|, #memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4] and [941] L121-4-->L122-3: Formula: (and (= |v_#pthreadsForks_63| |v_ULTIMATE.start_main_#t~pre29#1_29|) (= (store |v_#memory_int_133| |v_ULTIMATE.start_main_~#t3~0#1.base_37| (store (select |v_#memory_int_133| |v_ULTIMATE.start_main_~#t3~0#1.base_37|) |v_ULTIMATE.start_main_~#t3~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre29#1_29|)) |v_#memory_int_132|) (= |v_#pthreadsForks_62| (+ |v_#pthreadsForks_63| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_37|, #memory_int=|v_#memory_int_133|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_29|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_37|, #memory_int=|v_#memory_int_132|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_37|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_19|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 12:49:21,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [917] L50-3-->L51-1: Formula: (= (select (select |v_#memory_int_124| v_~get1~0.base_23) (+ v_~get1~0.offset_23 (* v_thread1Thread1of1ForFork0_~i~0_53 4))) |v_thread1Thread1of1ForFork0_#t~mem4_11|) InVars {#memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_11|, #memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-13 12:49:21,998 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:49:21,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 999 [2022-12-13 12:49:21,999 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 206 transitions, 2844 flow [2022-12-13 12:49:21,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:49:21,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:21,999 INFO L214 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] [2022-12-13 12:49:21,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 12:49:22,000 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:22,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash 857634018, now seen corresponding path program 2 times [2022-12-13 12:49:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:22,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358953739] [2022-12-13 12:49:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:22,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358953739] [2022-12-13 12:49:22,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358953739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:22,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:22,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 12:49:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043885450] [2022-12-13 12:49:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:22,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:49:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:49:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:49:22,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 12:49:22,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 206 transitions, 2844 flow. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:49:22,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:22,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 12:49:22,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:27,013 INFO L130 PetriNetUnfolder]: 16797/23513 cut-off events. [2022-12-13 12:49:27,013 INFO L131 PetriNetUnfolder]: For 185076/185076 co-relation queries the response was YES. [2022-12-13 12:49:27,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108332 conditions, 23513 events. 16797/23513 cut-off events. For 185076/185076 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 132521 event pairs, 3398 based on Foata normal form. 1/23513 useless extension candidates. Maximal degree in co-relation 108255. Up to 6875 conditions per place. [2022-12-13 12:49:27,211 INFO L137 encePairwiseOnDemand]: 21/53 looper letters, 338 selfloop transitions, 222 changer transitions 25/585 dead transitions. [2022-12-13 12:49:27,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 585 transitions, 7845 flow [2022-12-13 12:49:27,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 12:49:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 12:49:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 290 transitions. [2022-12-13 12:49:27,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28798411122144985 [2022-12-13 12:49:27,213 INFO L175 Difference]: Start difference. First operand has 124 places, 206 transitions, 2844 flow. Second operand 19 states and 290 transitions. [2022-12-13 12:49:27,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 585 transitions, 7845 flow [2022-12-13 12:49:27,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 585 transitions, 7772 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-13 12:49:27,510 INFO L231 Difference]: Finished difference. Result has 146 places, 333 transitions, 5450 flow [2022-12-13 12:49:27,510 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5450, PETRI_PLACES=146, PETRI_TRANSITIONS=333} [2022-12-13 12:49:27,511 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 108 predicate places. [2022-12-13 12:49:27,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:27,511 INFO L89 Accepts]: Start accepts. Operand has 146 places, 333 transitions, 5450 flow [2022-12-13 12:49:27,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:27,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:27,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 333 transitions, 5450 flow [2022-12-13 12:49:27,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 333 transitions, 5450 flow [2022-12-13 12:49:27,890 INFO L130 PetriNetUnfolder]: 1755/3614 cut-off events. [2022-12-13 12:49:27,891 INFO L131 PetriNetUnfolder]: For 43021/43322 co-relation queries the response was YES. [2022-12-13 12:49:27,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17963 conditions, 3614 events. 1755/3614 cut-off events. For 43021/43322 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 28618 event pairs, 182 based on Foata normal form. 93/3606 useless extension candidates. Maximal degree in co-relation 17774. Up to 735 conditions per place. [2022-12-13 12:49:27,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 333 transitions, 5450 flow [2022-12-13 12:49:27,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 2560 [2022-12-13 12:49:28,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [940] L69-6-->L70-1: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_47 v_~n3~0_34) (< v_thread2Thread1of1ForFork1_~i~1_47 v_~n2~0_30) (= |v_thread2Thread1of1ForFork1_#t~mem7_21| (select (select |v_#memory_int_130| v_~get2~0.base_33) (+ v_~get2~0.offset_33 (* v_thread2Thread1of1ForFork1_~i~1_47 4))))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_47, ~n2~0=v_~n2~0_30, ~n3~0=v_~n3~0_34, ~get2~0.offset=v_~get2~0.offset_33, #memory_int=|v_#memory_int_130|, ~get2~0.base=v_~get2~0.base_33} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_21|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_47, ~n2~0=v_~n2~0_30, ~n3~0=v_~n3~0_34, ~get2~0.offset=v_~get2~0.offset_33, #memory_int=|v_#memory_int_130|, ~get2~0.base=v_~get2~0.base_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] and [1094] L50-3-->L69-6: Formula: (and (= (select (select |v_#memory_int_472| v_~get1~0.base_149) (+ v_~get1~0.offset_149 (* v_thread1Thread1of1ForFork0_~i~0_126 4))) |v_thread1Thread1of1ForFork0_#t~mem4_71|) (= (+ v_thread2Thread1of1ForFork1_~i~1_115 1) v_thread2Thread1of1ForFork1_~i~1_114) (= (select (select |v_#memory_int_472| v_~get3~0.base_134) (+ v_~get3~0.offset_134 (* v_thread2Thread1of1ForFork1_~i~1_115 4))) |v_thread2Thread1of1ForFork1_#t~mem7_82|)) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_82|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_115, ~get3~0.base=v_~get3~0.base_134, #memory_int=|v_#memory_int_472|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_126, ~get3~0.offset=v_~get3~0.offset_134, ~get1~0.offset=v_~get1~0.offset_149, ~get1~0.base=v_~get1~0.base_149} OutVars{~get3~0.base=v_~get3~0.base_134, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_126, ~get3~0.offset=v_~get3~0.offset_134, ~get1~0.base=v_~get1~0.base_149, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_114, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_74|, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_77|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_70|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_71|, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_24|, #memory_int=|v_#memory_int_472|, ~get1~0.offset=v_~get1~0.offset_149} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork1_#t~post6] [2022-12-13 12:49:28,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [940] L69-6-->L70-1: Formula: (and (< v_thread2Thread1of1ForFork1_~i~1_47 v_~n3~0_34) (< v_thread2Thread1of1ForFork1_~i~1_47 v_~n2~0_30) (= |v_thread2Thread1of1ForFork1_#t~mem7_21| (select (select |v_#memory_int_130| v_~get2~0.base_33) (+ v_~get2~0.offset_33 (* v_thread2Thread1of1ForFork1_~i~1_47 4))))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_47, ~n2~0=v_~n2~0_30, ~n3~0=v_~n3~0_34, ~get2~0.offset=v_~get2~0.offset_33, #memory_int=|v_#memory_int_130|, ~get2~0.base=v_~get2~0.base_33} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_21|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_47, ~n2~0=v_~n2~0_30, ~n3~0=v_~n3~0_34, ~get2~0.offset=v_~get2~0.offset_33, #memory_int=|v_#memory_int_130|, ~get2~0.base=v_~get2~0.base_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] and [1012] L89-6-->L89-6: Formula: (and (< v_thread3Thread1of1ForFork2_~i~2_44 v_~n1~0_76) (let ((.cse0 (* v_thread3Thread1of1ForFork2_~i~2_44 4))) (= (select (select |v_#memory_int_220| v_~get3~0.base_51) (+ .cse0 v_~get3~0.offset_51)) (select (select |v_#memory_int_220| v_~get1~0.base_57) (+ .cse0 v_~get1~0.offset_57)))) (= v_thread3Thread1of1ForFork2_~i~2_43 (+ v_thread3Thread1of1ForFork2_~i~2_44 1)) (< v_thread3Thread1of1ForFork2_~i~2_44 v_~n3~0_66)) InVars {~get3~0.base=v_~get3~0.base_51, ~n3~0=v_~n3~0_66, ~n1~0=v_~n1~0_76, #memory_int=|v_#memory_int_220|, ~get3~0.offset=v_~get3~0.offset_51, ~get1~0.offset=v_~get1~0.offset_57, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_44, ~get1~0.base=v_~get1~0.base_57} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_37|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_35|, ~get3~0.base=v_~get3~0.base_51, ~n3~0=v_~n3~0_66, ~n1~0=v_~n1~0_76, #memory_int=|v_#memory_int_220|, thread3Thread1of1ForFork2_#t~post11=|v_thread3Thread1of1ForFork2_#t~post11_19|, ~get3~0.offset=v_~get3~0.offset_51, ~get1~0.offset=v_~get1~0.offset_57, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_43, ~get1~0.base=v_~get1~0.base_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#t~post11, thread3Thread1of1ForFork2_~i~2] [2022-12-13 12:49:28,113 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:49:28,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 603 [2022-12-13 12:49:28,114 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 332 transitions, 5462 flow [2022-12-13 12:49:28,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 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-12-13 12:49:28,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:28,114 INFO L214 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] [2022-12-13 12:49:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 12:49:28,114 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1193996100, now seen corresponding path program 1 times [2022-12-13 12:49:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:28,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342608264] [2022-12-13 12:49:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:29,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342608264] [2022-12-13 12:49:29,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342608264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:29,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:29,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:49:29,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803922963] [2022-12-13 12:49:29,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:29,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:49:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:49:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:49:29,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 12:49:29,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 332 transitions, 5462 flow. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:49:29,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:29,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 12:49:29,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:32,813 INFO L130 PetriNetUnfolder]: 17257/24477 cut-off events. [2022-12-13 12:49:32,813 INFO L131 PetriNetUnfolder]: For 243966/243966 co-relation queries the response was YES. [2022-12-13 12:49:32,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124604 conditions, 24477 events. 17257/24477 cut-off events. For 243966/243966 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 142268 event pairs, 6572 based on Foata normal form. 1/24477 useless extension candidates. Maximal degree in co-relation 124013. Up to 11993 conditions per place. [2022-12-13 12:49:32,962 INFO L137 encePairwiseOnDemand]: 40/58 looper letters, 542 selfloop transitions, 67 changer transitions 12/621 dead transitions. [2022-12-13 12:49:32,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 621 transitions, 10371 flow [2022-12-13 12:49:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:49:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 12:49:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2022-12-13 12:49:32,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3371647509578544 [2022-12-13 12:49:32,963 INFO L175 Difference]: Start difference. First operand has 144 places, 332 transitions, 5462 flow. Second operand 9 states and 176 transitions. [2022-12-13 12:49:32,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 621 transitions, 10371 flow [2022-12-13 12:49:34,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 621 transitions, 9946 flow, removed 207 selfloop flow, removed 5 redundant places. [2022-12-13 12:49:34,106 INFO L231 Difference]: Finished difference. Result has 154 places, 397 transitions, 6712 flow [2022-12-13 12:49:34,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=5219, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6712, PETRI_PLACES=154, PETRI_TRANSITIONS=397} [2022-12-13 12:49:34,106 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 116 predicate places. [2022-12-13 12:49:34,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:34,106 INFO L89 Accepts]: Start accepts. Operand has 154 places, 397 transitions, 6712 flow [2022-12-13 12:49:34,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:34,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:34,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 397 transitions, 6712 flow [2022-12-13 12:49:34,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 397 transitions, 6712 flow [2022-12-13 12:49:34,421 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][304], [486#true, Black: 508#true, 133#thread2EXITtrue, Black: 515#true, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 119#thread3EXITtrue, Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 878#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (or (<= (+ |thread2Thread1of1ForFork1_#t~mem9| 1) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 618#true, Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 880#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:49:34,422 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:34,422 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:34,422 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:34,422 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:34,429 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][311], [486#true, Black: 508#true, 133#thread2EXITtrue, Black: 515#true, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 119#thread3EXITtrue, Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 618#true, Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 878#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (or (<= (+ |thread2Thread1of1ForFork1_#t~mem9| 1) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 880#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))]) [2022-12-13 12:49:34,430 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:34,430 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:34,430 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:34,430 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:34,450 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][335], [486#true, Black: 508#true, 133#thread2EXITtrue, Black: 515#true, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 119#thread3EXITtrue, Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 878#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (or (<= (+ |thread2Thread1of1ForFork1_#t~mem9| 1) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 618#true, Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 880#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 856#true, Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:49:34,450 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 12:49:34,450 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:34,450 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:49:34,451 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 12:49:34,493 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][390], [486#true, Black: 508#true, 714#(<= ~res1~0 0), Black: 515#true, 133#thread2EXITtrue, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 119#thread3EXITtrue, Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 618#true, Black: 878#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (or (<= (+ |thread2Thread1of1ForFork1_#t~mem9| 1) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 880#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), 856#true]) [2022-12-13 12:49:34,493 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 12:49:34,494 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 12:49:34,494 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:49:34,494 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 12:49:34,517 INFO L130 PetriNetUnfolder]: 1849/3986 cut-off events. [2022-12-13 12:49:34,517 INFO L131 PetriNetUnfolder]: For 48304/48654 co-relation queries the response was YES. [2022-12-13 12:49:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19744 conditions, 3986 events. 1849/3986 cut-off events. For 48304/48654 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 32984 event pairs, 212 based on Foata normal form. 115/3993 useless extension candidates. Maximal degree in co-relation 19641. Up to 744 conditions per place. [2022-12-13 12:49:34,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 397 transitions, 6712 flow [2022-12-13 12:49:34,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 2900 [2022-12-13 12:49:34,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-13 12:49:34,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-13 12:49:34,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-13 12:49:35,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:49:35,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1189 [2022-12-13 12:49:35,295 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 396 transitions, 6759 flow [2022-12-13 12:49:35,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:49:35,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:35,295 INFO L214 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] [2022-12-13 12:49:35,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 12:49:35,295 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 274327173, now seen corresponding path program 1 times [2022-12-13 12:49:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:35,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800521648] [2022-12-13 12:49:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:36,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:36,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800521648] [2022-12-13 12:49:36,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800521648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:36,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:36,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:49:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885988591] [2022-12-13 12:49:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:36,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:49:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:49:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:49:36,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 12:49:36,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 396 transitions, 6759 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:49:36,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:36,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 12:49:36,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:40,063 INFO L130 PetriNetUnfolder]: 17464/24803 cut-off events. [2022-12-13 12:49:40,063 INFO L131 PetriNetUnfolder]: For 252901/252901 co-relation queries the response was YES. [2022-12-13 12:49:40,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126649 conditions, 24803 events. 17464/24803 cut-off events. For 252901/252901 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 145749 event pairs, 4615 based on Foata normal form. 2/24805 useless extension candidates. Maximal degree in co-relation 126509. Up to 10182 conditions per place. [2022-12-13 12:49:40,228 INFO L137 encePairwiseOnDemand]: 35/64 looper letters, 442 selfloop transitions, 118 changer transitions 9/569 dead transitions. [2022-12-13 12:49:40,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 569 transitions, 9208 flow [2022-12-13 12:49:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:49:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:49:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2022-12-13 12:49:40,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2713068181818182 [2022-12-13 12:49:40,229 INFO L175 Difference]: Start difference. First operand has 151 places, 396 transitions, 6759 flow. Second operand 11 states and 191 transitions. [2022-12-13 12:49:40,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 569 transitions, 9208 flow [2022-12-13 12:49:41,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 569 transitions, 9128 flow, removed 39 selfloop flow, removed 3 redundant places. [2022-12-13 12:49:41,150 INFO L231 Difference]: Finished difference. Result has 160 places, 397 transitions, 6980 flow [2022-12-13 12:49:41,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=6703, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6980, PETRI_PLACES=160, PETRI_TRANSITIONS=397} [2022-12-13 12:49:41,150 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2022-12-13 12:49:41,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:41,151 INFO L89 Accepts]: Start accepts. Operand has 160 places, 397 transitions, 6980 flow [2022-12-13 12:49:41,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:41,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:41,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 397 transitions, 6980 flow [2022-12-13 12:49:41,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 397 transitions, 6980 flow [2022-12-13 12:49:41,478 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][317], [486#true, Black: 508#true, Black: 515#true, 133#thread2EXITtrue, 214#L49-6true, 902#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 916#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (or (<= (+ (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 1) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~res3~0 1)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 119#thread3EXITtrue, Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 618#true, 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:49:41,479 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:41,479 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:41,479 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:41,479 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:41,487 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][327], [486#true, Black: 508#true, Black: 515#true, 133#thread2EXITtrue, 214#L49-6true, 902#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 916#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (or (<= (+ (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 1) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~res3~0 1)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 119#thread3EXITtrue, Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 618#true, Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))]) [2022-12-13 12:49:41,487 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:41,487 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:41,487 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:41,487 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:41,551 INFO L130 PetriNetUnfolder]: 1855/4042 cut-off events. [2022-12-13 12:49:41,551 INFO L131 PetriNetUnfolder]: For 52090/52460 co-relation queries the response was YES. [2022-12-13 12:49:41,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20538 conditions, 4042 events. 1855/4042 cut-off events. For 52090/52460 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 33990 event pairs, 217 based on Foata normal form. 116/4039 useless extension candidates. Maximal degree in co-relation 20431. Up to 751 conditions per place. [2022-12-13 12:49:41,618 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 397 transitions, 6980 flow [2022-12-13 12:49:41,618 INFO L226 LiptonReduction]: Number of co-enabled transitions 2944 [2022-12-13 12:49:41,632 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:41,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 483 [2022-12-13 12:49:41,633 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 397 transitions, 6980 flow [2022-12-13 12:49:41,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:49:41,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:41,633 INFO L214 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] [2022-12-13 12:49:41,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 12:49:41,633 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash 534778651, now seen corresponding path program 1 times [2022-12-13 12:49:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:41,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604963522] [2022-12-13 12:49:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:42,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:42,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604963522] [2022-12-13 12:49:42,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604963522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:42,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:42,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:49:42,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779612240] [2022-12-13 12:49:42,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:42,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:49:42,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:42,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:49:42,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:49:42,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 12:49:42,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 397 transitions, 6980 flow. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:49:42,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:42,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 12:49:42,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:46,193 INFO L130 PetriNetUnfolder]: 17460/24794 cut-off events. [2022-12-13 12:49:46,193 INFO L131 PetriNetUnfolder]: For 275448/275448 co-relation queries the response was YES. [2022-12-13 12:49:46,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130287 conditions, 24794 events. 17460/24794 cut-off events. For 275448/275448 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 144294 event pairs, 4414 based on Foata normal form. 1/24795 useless extension candidates. Maximal degree in co-relation 130147. Up to 6677 conditions per place. [2022-12-13 12:49:46,354 INFO L137 encePairwiseOnDemand]: 29/62 looper letters, 429 selfloop transitions, 261 changer transitions 9/699 dead transitions. [2022-12-13 12:49:46,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 699 transitions, 11335 flow [2022-12-13 12:49:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:49:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 12:49:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 242 transitions. [2022-12-13 12:49:46,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 12:49:46,355 INFO L175 Difference]: Start difference. First operand has 159 places, 397 transitions, 6980 flow. Second operand 11 states and 242 transitions. [2022-12-13 12:49:46,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 699 transitions, 11335 flow [2022-12-13 12:49:47,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 699 transitions, 11077 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 12:49:47,229 INFO L231 Difference]: Finished difference. Result has 163 places, 445 transitions, 8183 flow [2022-12-13 12:49:47,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=6773, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8183, PETRI_PLACES=163, PETRI_TRANSITIONS=445} [2022-12-13 12:49:47,230 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 125 predicate places. [2022-12-13 12:49:47,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:47,230 INFO L89 Accepts]: Start accepts. Operand has 163 places, 445 transitions, 8183 flow [2022-12-13 12:49:47,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:47,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:47,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 445 transitions, 8183 flow [2022-12-13 12:49:47,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 445 transitions, 8183 flow [2022-12-13 12:49:47,665 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][331], [486#true, Black: 508#true, Black: 515#true, 133#thread2EXITtrue, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 937#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 933#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0) (<= ~res1~0 0)) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 943#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (or (<= (+ ~res2~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~mem4| 1) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~res3~0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 119#thread3EXITtrue, Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 618#true, Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:49:47,666 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:47,666 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:47,666 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:47,666 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:47,674 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][356], [486#true, Black: 508#true, Black: 515#true, 133#thread2EXITtrue, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 937#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 933#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (<= (+ ~res2~0 1) 0) (<= 1 ~res3~0) (<= ~res1~0 0)) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 943#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (or (<= (+ ~res2~0 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~mem4| 1) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~res3~0)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 119#thread3EXITtrue, Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 618#true, Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1))), 868#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))]) [2022-12-13 12:49:47,675 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:47,675 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:47,675 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:47,675 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:47,741 INFO L130 PetriNetUnfolder]: 1878/4068 cut-off events. [2022-12-13 12:49:47,741 INFO L131 PetriNetUnfolder]: For 56891/57273 co-relation queries the response was YES. [2022-12-13 12:49:47,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21386 conditions, 4068 events. 1878/4068 cut-off events. For 56891/57273 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 33974 event pairs, 220 based on Foata normal form. 116/4066 useless extension candidates. Maximal degree in co-relation 21183. Up to 754 conditions per place. [2022-12-13 12:49:47,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 445 transitions, 8183 flow [2022-12-13 12:49:47,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 3284 [2022-12-13 12:49:47,802 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:47,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 573 [2022-12-13 12:49:47,803 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 445 transitions, 8183 flow [2022-12-13 12:49:47,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-13 12:49:47,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:47,803 INFO L214 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] [2022-12-13 12:49:47,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 12:49:47,803 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:47,803 INFO L85 PathProgramCache]: Analyzing trace with hash 757122179, now seen corresponding path program 1 times [2022-12-13 12:49:47,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:47,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63609851] [2022-12-13 12:49:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:48,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:48,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63609851] [2022-12-13 12:49:48,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63609851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:48,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:48,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:49:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488835799] [2022-12-13 12:49:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:48,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:49:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:48,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:49:48,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:49:48,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 12:49:48,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 445 transitions, 8183 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:49:48,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:48,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 12:49:48,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:49:52,758 INFO L130 PetriNetUnfolder]: 18581/26308 cut-off events. [2022-12-13 12:49:52,758 INFO L131 PetriNetUnfolder]: For 336074/336074 co-relation queries the response was YES. [2022-12-13 12:49:52,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144079 conditions, 26308 events. 18581/26308 cut-off events. For 336074/336074 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 153844 event pairs, 3789 based on Foata normal form. 2/26310 useless extension candidates. Maximal degree in co-relation 143572. Up to 7107 conditions per place. [2022-12-13 12:49:52,954 INFO L137 encePairwiseOnDemand]: 23/60 looper letters, 307 selfloop transitions, 389 changer transitions 22/718 dead transitions. [2022-12-13 12:49:52,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 718 transitions, 13101 flow [2022-12-13 12:49:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 12:49:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 12:49:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 227 transitions. [2022-12-13 12:49:52,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23645833333333333 [2022-12-13 12:49:52,955 INFO L175 Difference]: Start difference. First operand has 162 places, 445 transitions, 8183 flow. Second operand 16 states and 227 transitions. [2022-12-13 12:49:52,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 718 transitions, 13101 flow [2022-12-13 12:49:54,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 718 transitions, 12656 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-12-13 12:49:54,037 INFO L231 Difference]: Finished difference. Result has 179 places, 531 transitions, 10883 flow [2022-12-13 12:49:54,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7866, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10883, PETRI_PLACES=179, PETRI_TRANSITIONS=531} [2022-12-13 12:49:54,038 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2022-12-13 12:49:54,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:49:54,038 INFO L89 Accepts]: Start accepts. Operand has 179 places, 531 transitions, 10883 flow [2022-12-13 12:49:54,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:49:54,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:49:54,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 531 transitions, 10883 flow [2022-12-13 12:49:54,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 531 transitions, 10883 flow [2022-12-13 12:49:54,430 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][376], [486#true, Black: 508#true, Black: 515#true, 133#thread2EXITtrue, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 973#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 937#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), 119#thread3EXITtrue, Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, Black: 979#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (and (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 971#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 977#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 975#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 983#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 967#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 981#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 985#(and (or (<= (+ |thread1Thread1of1ForFork0_#t~mem4| 1) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~res3~0 1)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (and (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 965#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 618#true, Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:49:54,431 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:54,431 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:54,431 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:54,431 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:54,437 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][392], [486#true, Black: 508#true, Black: 515#true, 133#thread2EXITtrue, 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 973#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 937#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 119#thread3EXITtrue, Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, Black: 979#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (and (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 971#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 977#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 975#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 983#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 967#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 981#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 985#(and (or (<= (+ |thread1Thread1of1ForFork0_#t~mem4| 1) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~res3~0 1)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (and (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 965#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 618#true, Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:49:54,437 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:49:54,437 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:49:54,437 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:54,437 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:49:54,613 INFO L130 PetriNetUnfolder]: 2175/4526 cut-off events. [2022-12-13 12:49:54,613 INFO L131 PetriNetUnfolder]: For 86209/86619 co-relation queries the response was YES. [2022-12-13 12:49:54,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26978 conditions, 4526 events. 2175/4526 cut-off events. For 86209/86619 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 37383 event pairs, 202 based on Foata normal form. 102/4504 useless extension candidates. Maximal degree in co-relation 26643. Up to 867 conditions per place. [2022-12-13 12:49:54,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 531 transitions, 10883 flow [2022-12-13 12:49:54,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 3610 [2022-12-13 12:49:54,686 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:49:54,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 649 [2022-12-13 12:49:54,687 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 531 transitions, 10883 flow [2022-12-13 12:49:54,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:49:54,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:49:54,687 INFO L214 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] [2022-12-13 12:49:54,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 12:49:54,687 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:49:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 969291669, now seen corresponding path program 1 times [2022-12-13 12:49:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:54,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549220825] [2022-12-13 12:49:54,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:49:55,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:55,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549220825] [2022-12-13 12:49:55,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549220825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:55,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:55,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:49:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396369247] [2022-12-13 12:49:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:55,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 12:49:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:55,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 12:49:55,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-13 12:49:55,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 12:49:55,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 531 transitions, 10883 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:49:55,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:49:55,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 12:49:55,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:50:00,565 INFO L130 PetriNetUnfolder]: 19082/27320 cut-off events. [2022-12-13 12:50:00,565 INFO L131 PetriNetUnfolder]: For 411026/411026 co-relation queries the response was YES. [2022-12-13 12:50:00,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157329 conditions, 27320 events. 19082/27320 cut-off events. For 411026/411026 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 163915 event pairs, 5154 based on Foata normal form. 1/27321 useless extension candidates. Maximal degree in co-relation 156466. Up to 10552 conditions per place. [2022-12-13 12:50:00,766 INFO L137 encePairwiseOnDemand]: 27/60 looper letters, 548 selfloop transitions, 387 changer transitions 10/945 dead transitions. [2022-12-13 12:50:00,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 945 transitions, 18174 flow [2022-12-13 12:50:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:50:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:50:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 279 transitions. [2022-12-13 12:50:00,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3576923076923077 [2022-12-13 12:50:00,767 INFO L175 Difference]: Start difference. First operand has 178 places, 531 transitions, 10883 flow. Second operand 13 states and 279 transitions. [2022-12-13 12:50:00,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 945 transitions, 18174 flow [2022-12-13 12:50:02,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 945 transitions, 17481 flow, removed 59 selfloop flow, removed 8 redundant places. [2022-12-13 12:50:02,288 INFO L231 Difference]: Finished difference. Result has 191 places, 659 transitions, 14389 flow [2022-12-13 12:50:02,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=10413, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14389, PETRI_PLACES=191, PETRI_TRANSITIONS=659} [2022-12-13 12:50:02,289 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 153 predicate places. [2022-12-13 12:50:02,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:50:02,289 INFO L89 Accepts]: Start accepts. Operand has 191 places, 659 transitions, 14389 flow [2022-12-13 12:50:02,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:50:02,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:50:02,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 659 transitions, 14389 flow [2022-12-13 12:50:02,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 659 transitions, 14389 flow [2022-12-13 12:50:02,765 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][513], [486#true, Black: 508#true, Black: 1018#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1020#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1022#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1014#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1012#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1016#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1010#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 515#true, Black: 1008#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 133#thread2EXITtrue, Black: 1026#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (or (<= (+ |thread2Thread1of1ForFork1_#t~mem9| 1) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 995#true, Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 937#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 119#thread3EXITtrue, Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, Black: 979#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (and (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 971#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 977#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 975#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 983#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 967#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 981#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 618#true, 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:50:02,766 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:50:02,766 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:50:02,766 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:50:02,766 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:50:02,775 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0][539], [486#true, Black: 508#true, 1018#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1020#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1022#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1014#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1012#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1016#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1010#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 515#true, Black: 1008#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 133#thread2EXITtrue, Black: 1026#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 2 ~n3~0) (= ~get3~0.offset 0) (or (<= (+ |thread2Thread1of1ForFork1_#t~mem9| 1) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (<= (+ ~res1~0 1) 0) (<= 1 ~res3~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 214#L49-6true, Black: 781#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 775#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 912#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 629#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 773#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 783#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 777#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 760#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 356#(<= ~count1~0 ~count3~0), Black: 779#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 686#(and (<= 1 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork0_~i~0 0)), 937#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 771#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 713#(and (= ~res1~0 0) (<= ~n1~0 ~n2~0)), Black: 556#(and (<= 4 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (+ (* |ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4)), Black: 569#(and (or (<= 1 ~res3~0) (<= ~count2~0 ~count3~0)) (<= ~count2~0 ~count1~0)), 456#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count3~0 ~count2~0)), Black: 708#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 119#thread3EXITtrue, Black: 839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 841#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (or (not (= |thread2Thread1of1ForFork1_#t~mem7| (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 829#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 825#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 821#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 833#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (<= 1 ~res3~0) (<= ~res1~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 250#L122-4true, Black: 979#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (and (= (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) |thread1Thread1of1ForFork0_#t~mem4|) (= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= (select (select |#memory_int| ~get3~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get3~0.offset)) (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)))) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 971#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 977#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 975#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 589#(and (<= ~count3~0 ~count2~0) (< ~count2~0 (+ ~count3~0 1))), Black: 983#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 967#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~get2~0.offset 0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 981#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) |thread1Thread1of1ForFork0_#t~mem4|) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 511#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), 738#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), 540#(<= ~count2~0 ~count1~0), Black: 478#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (<= ~count3~0 ~count2~0)), Black: 743#(and (<= 1 ~n2~0) (<= 1 ~n3~0) (= thread2Thread1of1ForFork1_~i~1 0)), 557#(<= ~count2~0 ~count1~0), 343#(<= ~count1~0 ~count3~0), 537#(and (<= ~count1~0 ~count2~0) (< ~count2~0 (+ ~count1~0 1))), Black: 618#true, Black: 752#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~n2~0) (+ ~n3~0 1)) (= ~res2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)), Black: 872#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 827#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 874#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 474#(<= ~count3~0 ~count2~0), Black: 876#(and (= |thread2Thread1of1ForFork1_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= |thread1Thread1of1ForFork0_#t~mem4| (select (select |#memory_int| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset))) (= thread3Thread1of1ForFork2_~stop~2 0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 870#(and (not (= ~get1~0.base ~get2~0.base)) (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= ~get3~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~get2~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 704#(and (<= ~count1~0 ~count3~0) (< ~count3~0 (+ ~count1~0 1))), Black: 489#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), Black: 492#(and (or (<= ~count1~0 ~count2~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (= ~res3~0 1)))]) [2022-12-13 12:50:02,775 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 12:50:02,775 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:50:02,775 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-13 12:50:02,776 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 12:50:02,866 INFO L130 PetriNetUnfolder]: 2248/4835 cut-off events. [2022-12-13 12:50:02,867 INFO L131 PetriNetUnfolder]: For 100110/100561 co-relation queries the response was YES. [2022-12-13 12:50:02,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29191 conditions, 4835 events. 2248/4835 cut-off events. For 100110/100561 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 41455 event pairs, 226 based on Foata normal form. 116/4818 useless extension candidates. Maximal degree in co-relation 29025. Up to 878 conditions per place. [2022-12-13 12:50:03,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 659 transitions, 14389 flow [2022-12-13 12:50:03,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 4414 [2022-12-13 12:50:03,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:50:03,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 754 [2022-12-13 12:50:03,043 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 659 transitions, 14389 flow [2022-12-13 12:50:03,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:50:03,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:50:03,043 INFO L214 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] [2022-12-13 12:50:03,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 12:50:03,043 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:50:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:50:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2069476451, now seen corresponding path program 2 times [2022-12-13 12:50:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:50:03,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473772581] [2022-12-13 12:50:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:50:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:50:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:50:03,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473772581] [2022-12-13 12:50:03,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473772581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:50:03,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:50:03,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 12:50:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875608902] [2022-12-13 12:50:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:50:03,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 12:50:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:50:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 12:50:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:50:03,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 12:50:03,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 659 transitions, 14389 flow. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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-12-13 12:50:03,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:50:03,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 12:50:03,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand