/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:30:44,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:30:44,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:30:44,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:30:44,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:30:44,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:30:44,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:30:44,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:30:44,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:30:44,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:30:44,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:30:44,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:30:44,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:30:44,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:30:44,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:30:44,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:30:44,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:30:44,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:30:44,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:30:44,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:30:44,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:30:44,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:30:44,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:30:44,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:30:44,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:30:44,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:30:44,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:30:44,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:30:44,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:30:44,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:30:44,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:30:44,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:30:44,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:30:44,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:30:44,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:30:44,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:30:44,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:30:44,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:30:44,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:30:44,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:30:44,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:30:44,321 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-RepeatedSemanticLbe.epf [2022-12-13 01:30:44,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:30:44,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:30:44,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:30:44,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:30:44,354 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:30:44,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:30:44,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:30:44,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:30:44,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:30:44,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:30:44,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:30:44,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:30:44,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:30:44,356 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:30:44,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:30:44,357 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:30:44,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:30:44,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:30:44,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:30:44,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:30:44,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:30:44,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:30:44,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:30:44,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:30:44,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:30:44,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:30:44,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:30:44,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:30:44,358 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 01:30:44,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:30:44,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:30:44,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:30:44,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:30:44,702 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:30:44,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-13 01:30:45,717 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:30:45,931 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:30:45,932 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-trans.wvr.c [2022-12-13 01:30:45,938 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db5dbb89/4c44171cb37d444081440c7d33547709/FLAG7ca79d767 [2022-12-13 01:30:45,948 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db5dbb89/4c44171cb37d444081440c7d33547709 [2022-12-13 01:30:45,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:30:45,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:30:45,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:30:45,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:30:45,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:30:45,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:30:45" (1/1) ... [2022-12-13 01:30:45,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3fa27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:45, skipping insertion in model container [2022-12-13 01:30:45,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:30:45" (1/1) ... [2022-12-13 01:30:45,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:30:45,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:30:46,107 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-node-trans.wvr.c[3945,3958] [2022-12-13 01:30:46,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:30:46,129 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:30:46,152 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-node-trans.wvr.c[3945,3958] [2022-12-13 01:30:46,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:30:46,170 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:30:46,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46 WrapperNode [2022-12-13 01:30:46,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:30:46,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:30:46,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:30:46,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:30:46,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,234 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 413 [2022-12-13 01:30:46,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:30:46,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:30:46,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:30:46,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:30:46,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,290 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:30:46,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:30:46,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:30:46,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:30:46,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (1/1) ... [2022-12-13 01:30:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:30:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:30:46,341 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 01:30:46,366 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 01:30:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:30:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:30:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:30:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:30:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:30:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:30:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:30:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:30:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:30:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:30:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:30:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 01:30:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:30:46,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:30:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:30:46,390 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 01:30:46,555 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:30:46,556 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:30:47,125 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:30:47,140 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:30:47,140 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 01:30:47,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:30:47 BoogieIcfgContainer [2022-12-13 01:30:47,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:30:47,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:30:47,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:30:47,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:30:47,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:30:45" (1/3) ... [2022-12-13 01:30:47,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad0dbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:30:47, skipping insertion in model container [2022-12-13 01:30:47,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:30:46" (2/3) ... [2022-12-13 01:30:47,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad0dbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:30:47, skipping insertion in model container [2022-12-13 01:30:47,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:30:47" (3/3) ... [2022-12-13 01:30:47,151 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2022-12-13 01:30:47,167 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:30:47,167 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:30:47,167 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:30:47,278 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:30:47,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 483 transitions, 990 flow [2022-12-13 01:30:47,558 INFO L130 PetriNetUnfolder]: 41/480 cut-off events. [2022-12-13 01:30:47,558 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:30:47,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 480 events. 41/480 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 632 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-13 01:30:47,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 483 transitions, 990 flow [2022-12-13 01:30:47,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 470 transitions, 958 flow [2022-12-13 01:30:47,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:30:47,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-13 01:30:47,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 470 transitions, 958 flow [2022-12-13 01:30:47,693 INFO L130 PetriNetUnfolder]: 41/470 cut-off events. [2022-12-13 01:30:47,694 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:30:47,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 470 events. 41/470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 630 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2022-12-13 01:30:47,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 470 transitions, 958 flow [2022-12-13 01:30:47,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 17280 [2022-12-13 01:31:05,200 INFO L241 LiptonReduction]: Total number of compositions: 429 [2022-12-13 01:31:05,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:31:05,219 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;@5835b75d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:31:05,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:31:05,227 INFO L130 PetriNetUnfolder]: 10/41 cut-off events. [2022-12-13 01:31:05,227 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:31:05,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:05,228 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, 1, 1, 1] [2022-12-13 01:31:05,228 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 01:31:05,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash -237819189, now seen corresponding path program 1 times [2022-12-13 01:31:05,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:05,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14459208] [2022-12-13 01:31:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:05,630 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 01:31:05,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:05,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14459208] [2022-12-13 01:31:05,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14459208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:05,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:05,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:31:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557159627] [2022-12-13 01:31:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:05,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:31:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:31:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:31:05,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 01:31:05,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 01:31:05,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:05,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 01:31:05,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:05,927 INFO L130 PetriNetUnfolder]: 727/1071 cut-off events. [2022-12-13 01:31:05,928 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-13 01:31:05,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1071 events. 727/1071 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4030 event pairs, 405 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 2079. Up to 795 conditions per place. [2022-12-13 01:31:05,935 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-13 01:31:05,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 246 flow [2022-12-13 01:31:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:31:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:31:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 01:31:05,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-13 01:31:05,949 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 102 flow. Second operand 3 states and 59 transitions. [2022-12-13 01:31:05,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 246 flow [2022-12-13 01:31:05,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:31:05,957 INFO L231 Difference]: Finished difference. Result has 40 places, 43 transitions, 108 flow [2022-12-13 01:31:05,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=43} [2022-12-13 01:31:05,962 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-13 01:31:05,962 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:05,962 INFO L89 Accepts]: Start accepts. Operand has 40 places, 43 transitions, 108 flow [2022-12-13 01:31:05,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:05,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:05,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-13 01:31:05,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 43 transitions, 108 flow [2022-12-13 01:31:05,981 INFO L130 PetriNetUnfolder]: 10/43 cut-off events. [2022-12-13 01:31:05,981 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:31:05,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 43 events. 10/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2022-12-13 01:31:05,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 43 transitions, 108 flow [2022-12-13 01:31:05,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-13 01:31:06,016 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:06,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 01:31:06,018 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 43 transitions, 108 flow [2022-12-13 01:31:06,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 01:31:06,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:06,019 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, 1, 1, 1, 1] [2022-12-13 01:31:06,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:31:06,023 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 01:31:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2107721905, now seen corresponding path program 1 times [2022-12-13 01:31:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:06,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103438616] [2022-12-13 01:31:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:06,175 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 01:31:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:06,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103438616] [2022-12-13 01:31:06,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103438616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:06,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:06,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:31:06,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783063714] [2022-12-13 01:31:06,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:06,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:31:06,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:06,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:31:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:31:06,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 01:31:06,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 43 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 01:31:06,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:06,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 01:31:06,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:06,399 INFO L130 PetriNetUnfolder]: 835/1231 cut-off events. [2022-12-13 01:31:06,400 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-13 01:31:06,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 1231 events. 835/1231 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4580 event pairs, 445 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 1476. Up to 857 conditions per place. [2022-12-13 01:31:06,406 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 55 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-13 01:31:06,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 274 flow [2022-12-13 01:31:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:31:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:31:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 01:31:06,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-13 01:31:06,407 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 108 flow. Second operand 3 states and 60 transitions. [2022-12-13 01:31:06,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 274 flow [2022-12-13 01:31:06,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:31:06,410 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 120 flow [2022-12-13 01:31:06,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-13 01:31:06,410 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-13 01:31:06,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:06,411 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 120 flow [2022-12-13 01:31:06,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:06,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:06,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-13 01:31:06,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 120 flow [2022-12-13 01:31:06,419 INFO L130 PetriNetUnfolder]: 10/44 cut-off events. [2022-12-13 01:31:06,419 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:31:06,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 44 events. 10/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2022-12-13 01:31:06,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 120 flow [2022-12-13 01:31:06,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:31:06,421 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:06,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 01:31:06,422 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 120 flow [2022-12-13 01:31:06,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 01:31:06,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:06,422 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, 1, 1, 1, 1, 1] [2022-12-13 01:31:06,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:31:06,423 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 01:31:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash 865441644, now seen corresponding path program 1 times [2022-12-13 01:31:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:06,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831370915] [2022-12-13 01:31:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:06,565 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 01:31:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:06,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831370915] [2022-12-13 01:31:06,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831370915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:06,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:06,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:31:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642525853] [2022-12-13 01:31:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:06,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:31:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:06,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:31:06,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:31:06,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 01:31:06,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 01:31:06,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:06,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 01:31:06,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:06,781 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-13 01:31:06,782 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-13 01:31:06,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3167 conditions, 1232 events. 835/1232 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4559 event pairs, 637 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 1604. Up to 1229 conditions per place. [2022-12-13 01:31:06,789 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 42 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-13 01:31:06,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 210 flow [2022-12-13 01:31:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:31:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:31:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-13 01:31:06,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-13 01:31:06,790 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 120 flow. Second operand 3 states and 46 transitions. [2022-12-13 01:31:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 210 flow [2022-12-13 01:31:06,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:31:06,793 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 126 flow [2022-12-13 01:31:06,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2022-12-13 01:31:06,794 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2022-12-13 01:31:06,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:06,794 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 126 flow [2022-12-13 01:31:06,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:06,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:06,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-13 01:31:06,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 45 transitions, 126 flow [2022-12-13 01:31:06,803 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 01:31:06,803 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:31:06,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-12-13 01:31:06,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 45 transitions, 126 flow [2022-12-13 01:31:06,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:31:09,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:09,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2292 [2022-12-13 01:31:09,086 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 122 flow [2022-12-13 01:31:09,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 01:31:09,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:09,086 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, 1, 1, 1, 1, 1] [2022-12-13 01:31:09,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:31:09,087 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 01:31:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:09,087 INFO L85 PathProgramCache]: Analyzing trace with hash 933338406, now seen corresponding path program 1 times [2022-12-13 01:31:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:09,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763877402] [2022-12-13 01:31:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:09,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:09,229 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 01:31:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:09,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763877402] [2022-12-13 01:31:09,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763877402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:09,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:09,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:31:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818872585] [2022-12-13 01:31:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:09,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:31:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:31:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:31:09,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:31:09,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 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 01:31:09,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:09,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:31:09,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:09,484 INFO L130 PetriNetUnfolder]: 943/1389 cut-off events. [2022-12-13 01:31:09,484 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2022-12-13 01:31:09,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1389 events. 943/1389 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5044 event pairs, 733 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 3361. Up to 1388 conditions per place. [2022-12-13 01:31:09,490 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 42 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 01:31:09,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 214 flow [2022-12-13 01:31:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:31:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:31:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 01:31:09,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-13 01:31:09,492 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 122 flow. Second operand 4 states and 44 transitions. [2022-12-13 01:31:09,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 214 flow [2022-12-13 01:31:09,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 206 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:31:09,495 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:09,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-13 01:31:09,496 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 01:31:09,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:09,496 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:09,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:09,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:09,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:09,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:09,504 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 01:31:09,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:31:09,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2022-12-13 01:31:09,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:09,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:31:09,806 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:09,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-13 01:31:09,807 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-13 01:31:09,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 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 01:31:09,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:09,807 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, 1, 1, 1, 1, 1] [2022-12-13 01:31:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:31:09,811 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 01:31:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1710610303, now seen corresponding path program 1 times [2022-12-13 01:31:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:09,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903161793] [2022-12-13 01:31:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:10,000 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 01:31:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903161793] [2022-12-13 01:31:10,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903161793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:10,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:10,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:31:10,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577773709] [2022-12-13 01:31:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:10,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:31:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:31:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:31:10,004 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 01:31:10,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:31:10,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:10,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 01:31:10,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:10,238 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-13 01:31:10,238 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-13 01:31:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 3002. Up to 1228 conditions per place. [2022-12-13 01:31:10,244 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 01:31:10,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-13 01:31:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:31:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:31:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 01:31:10,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 01:31:10,248 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-13 01:31:10,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-13 01:31:10,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 01:31:10,250 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,250 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-13 01:31:10,252 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 01:31:10,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:10,252 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,254 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:10,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:10,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,261 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 01:31:10,262 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:31:10,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2022-12-13 01:31:10,262 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,262 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:31:10,559 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:10,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-13 01:31:10,560 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-13 01:31:10,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:31:10,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:10,560 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, 1, 1, 1, 1, 1] [2022-12-13 01:31:10,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:31:10,561 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 01:31:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -174693395, now seen corresponding path program 1 times [2022-12-13 01:31:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:10,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494039189] [2022-12-13 01:31:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:10,676 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 01:31:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494039189] [2022-12-13 01:31:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494039189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:10,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:10,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:31:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413199671] [2022-12-13 01:31:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:10,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:31:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:10,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:31:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:31:10,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 01:31:10,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:31:10,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:10,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 01:31:10,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:10,889 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-13 01:31:10,889 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 01:31:10,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 2998. Up to 1228 conditions per place. [2022-12-13 01:31:10,895 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 01:31:10,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 214 flow [2022-12-13 01:31:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:31:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:31:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 01:31:10,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 01:31:10,897 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 4 states and 47 transitions. [2022-12-13 01:31:10,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 214 flow [2022-12-13 01:31:10,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 01:31:10,900 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,900 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-13 01:31:10,901 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 01:31:10,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:10,901 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:10,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:10,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,909 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 01:31:10,909 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:31:10,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-13 01:31:10,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:10,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:31:11,173 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:11,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-13 01:31:11,174 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 124 flow [2022-12-13 01:31:11,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:31:11,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:11,175 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, 1, 1, 1, 1, 1] [2022-12-13 01:31:11,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:31:11,175 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 01:31:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1300023411, now seen corresponding path program 1 times [2022-12-13 01:31:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:11,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100073298] [2022-12-13 01:31:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:11,372 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 01:31:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:11,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100073298] [2022-12-13 01:31:11,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100073298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:11,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:11,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497345619] [2022-12-13 01:31:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:11,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:31:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:31:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:31:11,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:31:11,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 01:31:11,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:11,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:31:11,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:11,603 INFO L130 PetriNetUnfolder]: 943/1389 cut-off events. [2022-12-13 01:31:11,603 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-13 01:31:11,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1389 events. 943/1389 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5044 event pairs, 733 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 3349. Up to 1386 conditions per place. [2022-12-13 01:31:11,611 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 40 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2022-12-13 01:31:11,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 216 flow [2022-12-13 01:31:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:31:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:31:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 01:31:11,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20952380952380953 [2022-12-13 01:31:11,612 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 124 flow. Second operand 5 states and 44 transitions. [2022-12-13 01:31:11,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 216 flow [2022-12-13 01:31:11,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 206 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 01:31:11,615 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 132 flow [2022-12-13 01:31:11,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-13 01:31:11,615 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-13 01:31:11,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:11,616 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 132 flow [2022-12-13 01:31:11,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:11,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:11,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-13 01:31:11,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 132 flow [2022-12-13 01:31:11,624 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 01:31:11,624 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:31:11,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 52. Up to 4 conditions per place. [2022-12-13 01:31:11,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 132 flow [2022-12-13 01:31:11,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:31:11,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:11,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-13 01:31:11,840 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 128 flow [2022-12-13 01:31:11,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 01:31:11,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:11,841 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, 1, 1, 1, 1, 1] [2022-12-13 01:31:11,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:31:11,841 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 01:31:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1330035469, now seen corresponding path program 1 times [2022-12-13 01:31:11,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:11,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637153785] [2022-12-13 01:31:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:12,053 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 01:31:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:12,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637153785] [2022-12-13 01:31:12,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637153785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:12,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:12,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:31:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936153518] [2022-12-13 01:31:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:12,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:31:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:31:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:31:12,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 01:31:12,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:31:12,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:12,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 01:31:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:12,246 INFO L130 PetriNetUnfolder]: 835/1232 cut-off events. [2022-12-13 01:31:12,246 INFO L131 PetriNetUnfolder]: For 230/230 co-relation queries the response was YES. [2022-12-13 01:31:12,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1232 events. 835/1232 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4553 event pairs, 637 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 2990. Up to 1228 conditions per place. [2022-12-13 01:31:12,252 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 01:31:12,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 218 flow [2022-12-13 01:31:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:31:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:31:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 01:31:12,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-13 01:31:12,253 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 128 flow. Second operand 4 states and 47 transitions. [2022-12-13 01:31:12,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 218 flow [2022-12-13 01:31:12,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 204 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 01:31:12,255 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:12,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-13 01:31:12,256 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 01:31:12,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:12,256 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:12,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:12,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:12,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:12,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:12,264 INFO L130 PetriNetUnfolder]: 10/45 cut-off events. [2022-12-13 01:31:12,264 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:31:12,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 45 events. 10/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2022-12-13 01:31:12,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 128 flow [2022-12-13 01:31:12,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:31:12,523 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:31:12,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 268 [2022-12-13 01:31:12,524 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 124 flow [2022-12-13 01:31:12,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:31:12,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:12,524 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, 1, 1, 1, 1, 1] [2022-12-13 01:31:12,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 01:31:12,524 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 01:31:12,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1717374927, now seen corresponding path program 1 times [2022-12-13 01:31:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:12,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105677708] [2022-12-13 01:31:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:13,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 01:31:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:13,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105677708] [2022-12-13 01:31:13,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105677708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:13,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:13,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:31:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156940613] [2022-12-13 01:31:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:13,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:31:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:31:13,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:31:13,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:31:13,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 124 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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 01:31:13,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:13,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:31:13,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:14,289 INFO L130 PetriNetUnfolder]: 1472/2269 cut-off events. [2022-12-13 01:31:14,289 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-13 01:31:14,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 2269 events. 1472/2269 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10344 event pairs, 717 based on Foata normal form. 1/2123 useless extension candidates. Maximal degree in co-relation 5487. Up to 1333 conditions per place. [2022-12-13 01:31:14,303 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 106 selfloop transitions, 11 changer transitions 13/130 dead transitions. [2022-12-13 01:31:14,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 130 transitions, 623 flow [2022-12-13 01:31:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:31:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:31:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-12-13 01:31:14,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2022-12-13 01:31:14,306 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 124 flow. Second operand 10 states and 125 transitions. [2022-12-13 01:31:14,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 130 transitions, 623 flow [2022-12-13 01:31:14,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 130 transitions, 614 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 01:31:14,313 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 191 flow [2022-12-13 01:31:14,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=191, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-13 01:31:14,314 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-13 01:31:14,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:14,314 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 191 flow [2022-12-13 01:31:14,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:14,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:14,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 191 flow [2022-12-13 01:31:14,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 191 flow [2022-12-13 01:31:14,332 INFO L130 PetriNetUnfolder]: 19/116 cut-off events. [2022-12-13 01:31:14,332 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-13 01:31:14,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 116 events. 19/116 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 458 event pairs, 0 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 213. Up to 15 conditions per place. [2022-12-13 01:31:14,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 191 flow [2022-12-13 01:31:14,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 01:31:14,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:14,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-13 01:31:14,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-13 01:31:15,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1309] L52-6-->L52-10: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_17|) (= (select (select |v_#memory_int_46| v_~get_2~0.base_9) (+ v_~get_2~0.offset_9 (* 4 v_~id_0~0_15))) |v_thread1Thread1of1ForFork1_#t~mem6#1_9|)) InVars {~get_2~0.offset=v_~get_2~0.offset_9, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} OutVars{~get_2~0.offset=v_~get_2~0.offset_9, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_9|, ~get_2~0.base=v_~get_2~0.base_9, #memory_int=|v_#memory_int_46|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_17|, ~id_0~0=v_~id_0~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem6#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:15,128 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:31:15,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 816 [2022-12-13 01:31:15,130 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 209 flow [2022-12-13 01:31:15,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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 01:31:15,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:15,130 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, 1, 1, 1, 1] [2022-12-13 01:31:15,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 01:31:15,131 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 01:31:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1440331023, now seen corresponding path program 1 times [2022-12-13 01:31:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:15,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884164994] [2022-12-13 01:31:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:15,816 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 01:31:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:15,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884164994] [2022-12-13 01:31:15,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884164994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:15,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:15,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:31:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236332295] [2022-12-13 01:31:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:15,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:31:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:31:15,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:31:15,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:31:15,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 209 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:31:15,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:15,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:31:15,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:16,614 INFO L130 PetriNetUnfolder]: 2095/3284 cut-off events. [2022-12-13 01:31:16,614 INFO L131 PetriNetUnfolder]: For 3268/3268 co-relation queries the response was YES. [2022-12-13 01:31:16,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9582 conditions, 3284 events. 2095/3284 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17114 event pairs, 416 based on Foata normal form. 1/3149 useless extension candidates. Maximal degree in co-relation 9546. Up to 1226 conditions per place. [2022-12-13 01:31:16,636 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 134 selfloop transitions, 22 changer transitions 9/165 dead transitions. [2022-12-13 01:31:16,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 165 transitions, 962 flow [2022-12-13 01:31:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:31:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:31:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-13 01:31:16,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4122340425531915 [2022-12-13 01:31:16,638 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 209 flow. Second operand 8 states and 155 transitions. [2022-12-13 01:31:16,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 165 transitions, 962 flow [2022-12-13 01:31:16,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 165 transitions, 943 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 01:31:16,654 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 404 flow [2022-12-13 01:31:16,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2022-12-13 01:31:16,656 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-12-13 01:31:16,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:16,656 INFO L89 Accepts]: Start accepts. Operand has 62 places, 72 transitions, 404 flow [2022-12-13 01:31:16,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:16,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:16,658 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 72 transitions, 404 flow [2022-12-13 01:31:16,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 72 transitions, 404 flow [2022-12-13 01:31:16,694 INFO L130 PetriNetUnfolder]: 74/334 cut-off events. [2022-12-13 01:31:16,694 INFO L131 PetriNetUnfolder]: For 419/456 co-relation queries the response was YES. [2022-12-13 01:31:16,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 334 events. 74/334 cut-off events. For 419/456 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2165 event pairs, 2 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 843. Up to 43 conditions per place. [2022-12-13 01:31:16,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 72 transitions, 404 flow [2022-12-13 01:31:16,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 738 [2022-12-13 01:31:16,710 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:16,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 01:31:16,711 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 72 transitions, 404 flow [2022-12-13 01:31:16,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:31:16,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:16,712 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, 1, 1, 1] [2022-12-13 01:31:16,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 01:31:16,712 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 01:31:16,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:16,712 INFO L85 PathProgramCache]: Analyzing trace with hash -886988291, now seen corresponding path program 1 times [2022-12-13 01:31:16,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:16,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472383367] [2022-12-13 01:31:16,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:16,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:17,710 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 01:31:17,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:17,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472383367] [2022-12-13 01:31:17,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472383367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:17,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:17,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 01:31:17,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027888888] [2022-12-13 01:31:17,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:17,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:31:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:17,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:31:17,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:31:17,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:31:17,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 72 transitions, 404 flow. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:17,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:17,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:31:17,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:18,635 INFO L130 PetriNetUnfolder]: 2223/3569 cut-off events. [2022-12-13 01:31:18,635 INFO L131 PetriNetUnfolder]: For 7512/7512 co-relation queries the response was YES. [2022-12-13 01:31:18,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12150 conditions, 3569 events. 2223/3569 cut-off events. For 7512/7512 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19073 event pairs, 1135 based on Foata normal form. 2/3434 useless extension candidates. Maximal degree in co-relation 12111. Up to 2457 conditions per place. [2022-12-13 01:31:18,657 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 120 selfloop transitions, 14 changer transitions 10/144 dead transitions. [2022-12-13 01:31:18,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 1029 flow [2022-12-13 01:31:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:31:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:31:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-13 01:31:18,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2553191489361702 [2022-12-13 01:31:18,659 INFO L175 Difference]: Start difference. First operand has 60 places, 72 transitions, 404 flow. Second operand 9 states and 108 transitions. [2022-12-13 01:31:18,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 1029 flow [2022-12-13 01:31:18,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 144 transitions, 1009 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 01:31:18,682 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 506 flow [2022-12-13 01:31:18,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2022-12-13 01:31:18,683 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2022-12-13 01:31:18,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:18,683 INFO L89 Accepts]: Start accepts. Operand has 70 places, 78 transitions, 506 flow [2022-12-13 01:31:18,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:18,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:18,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 78 transitions, 506 flow [2022-12-13 01:31:18,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 78 transitions, 506 flow [2022-12-13 01:31:18,729 INFO L130 PetriNetUnfolder]: 82/393 cut-off events. [2022-12-13 01:31:18,729 INFO L131 PetriNetUnfolder]: For 913/964 co-relation queries the response was YES. [2022-12-13 01:31:18,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 393 events. 82/393 cut-off events. For 913/964 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2747 event pairs, 3 based on Foata normal form. 5/361 useless extension candidates. Maximal degree in co-relation 1073. Up to 50 conditions per place. [2022-12-13 01:31:18,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 78 transitions, 506 flow [2022-12-13 01:31:18,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-13 01:31:18,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1856] L52-6-->L102-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre48#1_169| |v_#pthreadsForks_291|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_72| |v_thread1Thread1of1ForFork1_minus_~b#1_78|) |v_thread1Thread1of1ForFork1_minus_~a#1_78|) (= (+ |v_#pthreadsForks_291| 1) |v_#pthreadsForks_290|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_98|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_54| (select (select |v_#memory_int_575| v_~get_2~0.base_105) (+ v_~get_2~0.offset_105 (* v_~id_0~0_195 4)))) (= (store |v_#memory_int_575| |v_ULTIMATE.start_main_~#t2~0#1.base_77| (store (select |v_#memory_int_575| |v_ULTIMATE.start_main_~#t2~0#1.base_77|) |v_ULTIMATE.start_main_~#t2~0#1.offset_77| |v_ULTIMATE.start_main_#t~pre48#1_169|)) |v_#memory_int_574|) (<= 0 (+ v_~result_9~0_106 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_54| |v_thread1Thread1of1ForFork1_minus_~a#1_78|) (= v_~result_9~0_106 |v_thread1Thread1of1ForFork1_minus_#res#1_72|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_109|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_38| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_52| |v_thread1Thread1of1ForFork1_minus_~b#1_78|) (= |v_thread1Thread1of1ForFork1_#res#1.base_38| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_78|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_78| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_78|))) 1 0)) (= (select (select |v_#memory_int_575| v_~get_5~0.base_120) (+ v_~get_5~0.offset_120 (* v_~id_3~0_220 4))) |v_thread1Thread1of1ForFork1_minus_#in~b#1_52|) (<= v_~result_9~0_106 2147483647)) InVars {~get_2~0.offset=v_~get_2~0.offset_105, #pthreadsForks=|v_#pthreadsForks_291|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_77|, ~get_5~0.base=v_~get_5~0.base_120, ~id_3~0=v_~id_3~0_220, #memory_int=|v_#memory_int_575|, ~get_2~0.base=v_~get_2~0.base_105, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_109|, ~id_0~0=v_~id_0~0_195, ~get_5~0.offset=v_~get_5~0.offset_120, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_77|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_54|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_169|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_77|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_90|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_49|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_66|, ~result_9~0=v_~result_9~0_106, #pthreadsForks=|v_#pthreadsForks_290|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_64|, ~id_3~0=v_~id_3~0_220, ~get_2~0.base=v_~get_2~0.base_105, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_63|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_76|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_38|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_70|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_98|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_58|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_72|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_52|, ~get_2~0.offset=v_~get_2~0.offset_105, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_78|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|, ~get_5~0.base=v_~get_5~0.base_120, #memory_int=|v_#memory_int_574|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_78|, ~id_0~0=v_~id_0~0_195, ~get_5~0.offset=v_~get_5~0.offset_120, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_77|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~nondet47#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre46#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] [2022-12-13 01:31:18,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] and [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] [2022-12-13 01:31:18,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:18,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-13 01:31:18,988 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 536 flow [2022-12-13 01:31:18,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:18,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:18,988 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, 1, 1, 1] [2022-12-13 01:31:18,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 01:31:18,989 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 01:31:18,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash 484564831, now seen corresponding path program 2 times [2022-12-13 01:31:18,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:18,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055632723] [2022-12-13 01:31:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:18,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:19,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 01:31:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055632723] [2022-12-13 01:31:19,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055632723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:19,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:19,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:31:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343759679] [2022-12-13 01:31:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:19,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:31:19,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:31:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:31:19,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:31:19,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 536 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:19,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:19,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:31:19,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:21,082 INFO L130 PetriNetUnfolder]: 2804/4663 cut-off events. [2022-12-13 01:31:21,082 INFO L131 PetriNetUnfolder]: For 14746/14746 co-relation queries the response was YES. [2022-12-13 01:31:21,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16937 conditions, 4663 events. 2804/4663 cut-off events. For 14746/14746 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27770 event pairs, 1560 based on Foata normal form. 2/4498 useless extension candidates. Maximal degree in co-relation 16893. Up to 3399 conditions per place. [2022-12-13 01:31:21,111 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 114 selfloop transitions, 30 changer transitions 22/166 dead transitions. [2022-12-13 01:31:21,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 166 transitions, 1316 flow [2022-12-13 01:31:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:31:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:31:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-12-13 01:31:21,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22820037105751392 [2022-12-13 01:31:21,114 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 536 flow. Second operand 11 states and 123 transitions. [2022-12-13 01:31:21,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 166 transitions, 1316 flow [2022-12-13 01:31:21,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 166 transitions, 1293 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 01:31:21,174 INFO L231 Difference]: Finished difference. Result has 83 places, 94 transitions, 770 flow [2022-12-13 01:31:21,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=770, PETRI_PLACES=83, PETRI_TRANSITIONS=94} [2022-12-13 01:31:21,175 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2022-12-13 01:31:21,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:21,175 INFO L89 Accepts]: Start accepts. Operand has 83 places, 94 transitions, 770 flow [2022-12-13 01:31:21,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:21,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:21,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 94 transitions, 770 flow [2022-12-13 01:31:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 94 transitions, 770 flow [2022-12-13 01:31:21,241 INFO L130 PetriNetUnfolder]: 106/565 cut-off events. [2022-12-13 01:31:21,242 INFO L131 PetriNetUnfolder]: For 2274/2392 co-relation queries the response was YES. [2022-12-13 01:31:21,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 565 events. 106/565 cut-off events. For 2274/2392 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4574 event pairs, 3 based on Foata normal form. 11/521 useless extension candidates. Maximal degree in co-relation 1782. Up to 77 conditions per place. [2022-12-13 01:31:21,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 94 transitions, 770 flow [2022-12-13 01:31:21,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-13 01:31:21,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:21,520 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:21,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-13 01:31:21,521 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 778 flow [2022-12-13 01:31:21,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:21,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:21,521 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, 1, 1, 1] [2022-12-13 01:31:21,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 01:31:21,521 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 01:31:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:21,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1631636303, now seen corresponding path program 3 times [2022-12-13 01:31:21,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:21,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293581341] [2022-12-13 01:31:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:21,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:22,543 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 01:31:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:22,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293581341] [2022-12-13 01:31:22,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293581341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:22,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:31:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757369560] [2022-12-13 01:31:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:31:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:22,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:31:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:31:22,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:31:22,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 778 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:22,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:22,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:31:22,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:23,710 INFO L130 PetriNetUnfolder]: 2789/4620 cut-off events. [2022-12-13 01:31:23,710 INFO L131 PetriNetUnfolder]: For 20703/20703 co-relation queries the response was YES. [2022-12-13 01:31:23,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18184 conditions, 4620 events. 2789/4620 cut-off events. For 20703/20703 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27485 event pairs, 1552 based on Foata normal form. 1/4454 useless extension candidates. Maximal degree in co-relation 18134. Up to 3361 conditions per place. [2022-12-13 01:31:23,744 INFO L137 encePairwiseOnDemand]: 35/50 looper letters, 139 selfloop transitions, 15 changer transitions 15/169 dead transitions. [2022-12-13 01:31:23,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 169 transitions, 1569 flow [2022-12-13 01:31:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:31:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:31:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2022-12-13 01:31:23,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-13 01:31:23,745 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 778 flow. Second operand 9 states and 115 transitions. [2022-12-13 01:31:23,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 169 transitions, 1569 flow [2022-12-13 01:31:23,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 169 transitions, 1522 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-13 01:31:23,841 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 811 flow [2022-12-13 01:31:23,841 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=811, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2022-12-13 01:31:23,842 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2022-12-13 01:31:23,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:23,842 INFO L89 Accepts]: Start accepts. Operand has 85 places, 94 transitions, 811 flow [2022-12-13 01:31:23,845 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:23,845 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:23,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 94 transitions, 811 flow [2022-12-13 01:31:23,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 94 transitions, 811 flow [2022-12-13 01:31:23,917 INFO L130 PetriNetUnfolder]: 109/579 cut-off events. [2022-12-13 01:31:23,917 INFO L131 PetriNetUnfolder]: For 2552/2673 co-relation queries the response was YES. [2022-12-13 01:31:23,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 579 events. 109/579 cut-off events. For 2552/2673 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4723 event pairs, 7 based on Foata normal form. 11/537 useless extension candidates. Maximal degree in co-relation 1812. Up to 81 conditions per place. [2022-12-13 01:31:23,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 94 transitions, 811 flow [2022-12-13 01:31:23,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 01:31:23,941 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:23,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 01:31:23,942 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 94 transitions, 811 flow [2022-12-13 01:31:23,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:23,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:23,942 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, 1, 1, 1] [2022-12-13 01:31:23,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 01:31:23,943 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 01:31:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash -163564268, now seen corresponding path program 1 times [2022-12-13 01:31:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:23,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377189276] [2022-12-13 01:31:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:24,345 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 01:31:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:24,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377189276] [2022-12-13 01:31:24,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377189276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:24,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:24,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428805283] [2022-12-13 01:31:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:24,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:31:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:24,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:31:24,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:31:24,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:31:24,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 94 transitions, 811 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:24,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:24,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:31:24,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:25,517 INFO L130 PetriNetUnfolder]: 2817/4736 cut-off events. [2022-12-13 01:31:25,517 INFO L131 PetriNetUnfolder]: For 22406/22406 co-relation queries the response was YES. [2022-12-13 01:31:25,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18607 conditions, 4736 events. 2817/4736 cut-off events. For 22406/22406 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28738 event pairs, 1048 based on Foata normal form. 1/4562 useless extension candidates. Maximal degree in co-relation 18556. Up to 2944 conditions per place. [2022-12-13 01:31:25,553 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 150 selfloop transitions, 51 changer transitions 8/209 dead transitions. [2022-12-13 01:31:25,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 209 transitions, 1798 flow [2022-12-13 01:31:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:31:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:31:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2022-12-13 01:31:25,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.348 [2022-12-13 01:31:25,555 INFO L175 Difference]: Start difference. First operand has 83 places, 94 transitions, 811 flow. Second operand 10 states and 174 transitions. [2022-12-13 01:31:25,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 209 transitions, 1798 flow [2022-12-13 01:31:25,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 209 transitions, 1759 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 01:31:25,657 INFO L231 Difference]: Finished difference. Result has 89 places, 110 transitions, 1111 flow [2022-12-13 01:31:25,657 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1111, PETRI_PLACES=89, PETRI_TRANSITIONS=110} [2022-12-13 01:31:25,658 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2022-12-13 01:31:25,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:25,658 INFO L89 Accepts]: Start accepts. Operand has 89 places, 110 transitions, 1111 flow [2022-12-13 01:31:25,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:25,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:25,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 110 transitions, 1111 flow [2022-12-13 01:31:25,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 110 transitions, 1111 flow [2022-12-13 01:31:25,734 INFO L130 PetriNetUnfolder]: 115/625 cut-off events. [2022-12-13 01:31:25,734 INFO L131 PetriNetUnfolder]: For 4109/4279 co-relation queries the response was YES. [2022-12-13 01:31:25,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 625 events. 115/625 cut-off events. For 4109/4279 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5200 event pairs, 6 based on Foata normal form. 12/582 useless extension candidates. Maximal degree in co-relation 2203. Up to 83 conditions per place. [2022-12-13 01:31:25,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 110 transitions, 1111 flow [2022-12-13 01:31:25,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 1036 [2022-12-13 01:31:25,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:31:26,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_5~0.base_33) (+ (* 4 v_~id_3~0_81) v_~get_5~0.offset_33)))) InVars {~get_5~0.base=v_~get_5~0.base_33, ~id_3~0=v_~id_3~0_81, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~get_5~0.offset=v_~get_5~0.offset_33} OutVars{~get_5~0.base=v_~get_5~0.base_33, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~id_3~0=v_~id_3~0_81, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~get_5~0.offset=v_~get_5~0.offset_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] [2022-12-13 01:31:26,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:27,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1633] L60-6-->L60-10: Formula: (and (not |v_thread2Thread1of1ForFork2_#t~short14#1_35|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_17| (select (select |v_#memory_int_236| v_~get_5~0.base_33) (+ (* 4 v_~id_3~0_81) v_~get_5~0.offset_33)))) InVars {~get_5~0.base=v_~get_5~0.base_33, ~id_3~0=v_~id_3~0_81, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~get_5~0.offset=v_~get_5~0.offset_33} OutVars{~get_5~0.base=v_~get_5~0.base_33, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_17|, ~id_3~0=v_~id_3~0_81, #memory_int=|v_#memory_int_236|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_35|, ~get_5~0.offset=v_~get_5~0.offset_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem15#1] [2022-12-13 01:31:27,606 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:27,607 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1949 [2022-12-13 01:31:27,607 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 109 transitions, 1123 flow [2022-12-13 01:31:27,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:27,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:27,607 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, 1, 1, 1] [2022-12-13 01:31:27,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 01:31:27,608 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 01:31:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -683307344, now seen corresponding path program 2 times [2022-12-13 01:31:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:27,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036607156] [2022-12-13 01:31:27,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:27,979 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 01:31:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:27,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036607156] [2022-12-13 01:31:27,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036607156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:27,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:27,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975821777] [2022-12-13 01:31:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:27,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:31:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:27,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:31:27,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:31:27,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:31:27,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 109 transitions, 1123 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:27,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:27,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:31:27,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:29,108 INFO L130 PetriNetUnfolder]: 2628/4426 cut-off events. [2022-12-13 01:31:29,108 INFO L131 PetriNetUnfolder]: For 28770/28770 co-relation queries the response was YES. [2022-12-13 01:31:29,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19072 conditions, 4426 events. 2628/4426 cut-off events. For 28770/28770 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 26656 event pairs, 972 based on Foata normal form. 1/4269 useless extension candidates. Maximal degree in co-relation 19022. Up to 2599 conditions per place. [2022-12-13 01:31:29,139 INFO L137 encePairwiseOnDemand]: 37/54 looper letters, 127 selfloop transitions, 55 changer transitions 9/191 dead transitions. [2022-12-13 01:31:29,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 1862 flow [2022-12-13 01:31:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:31:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:31:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 01:31:29,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34953703703703703 [2022-12-13 01:31:29,140 INFO L175 Difference]: Start difference. First operand has 87 places, 109 transitions, 1123 flow. Second operand 8 states and 151 transitions. [2022-12-13 01:31:29,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 1862 flow [2022-12-13 01:31:29,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 191 transitions, 1745 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-12-13 01:31:29,279 INFO L231 Difference]: Finished difference. Result has 93 places, 113 transitions, 1223 flow [2022-12-13 01:31:29,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1223, PETRI_PLACES=93, PETRI_TRANSITIONS=113} [2022-12-13 01:31:29,279 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2022-12-13 01:31:29,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:29,280 INFO L89 Accepts]: Start accepts. Operand has 93 places, 113 transitions, 1223 flow [2022-12-13 01:31:29,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:29,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:29,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 113 transitions, 1223 flow [2022-12-13 01:31:29,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 113 transitions, 1223 flow [2022-12-13 01:31:29,356 INFO L130 PetriNetUnfolder]: 113/592 cut-off events. [2022-12-13 01:31:29,356 INFO L131 PetriNetUnfolder]: For 4412/4607 co-relation queries the response was YES. [2022-12-13 01:31:29,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 592 events. 113/592 cut-off events. For 4412/4607 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4824 event pairs, 6 based on Foata normal form. 15/552 useless extension candidates. Maximal degree in co-relation 2216. Up to 78 conditions per place. [2022-12-13 01:31:29,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 113 transitions, 1223 flow [2022-12-13 01:31:29,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 1062 [2022-12-13 01:31:29,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:29,935 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:29,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 657 [2022-12-13 01:31:29,936 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 112 transitions, 1221 flow [2022-12-13 01:31:29,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:29,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:29,937 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, 1, 1, 1] [2022-12-13 01:31:29,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 01:31:29,937 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 01:31:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash -794576973, now seen corresponding path program 4 times [2022-12-13 01:31:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:29,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345099764] [2022-12-13 01:31:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:30,858 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 01:31:30,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:30,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345099764] [2022-12-13 01:31:30,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345099764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:30,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:30,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:31:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487211938] [2022-12-13 01:31:30,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:30,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:31:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:31:30,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:31:30,859 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:31:30,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 112 transitions, 1221 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:30,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:30,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:31:30,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:32,017 INFO L130 PetriNetUnfolder]: 2567/4296 cut-off events. [2022-12-13 01:31:32,018 INFO L131 PetriNetUnfolder]: For 28556/28556 co-relation queries the response was YES. [2022-12-13 01:31:32,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18678 conditions, 4296 events. 2567/4296 cut-off events. For 28556/28556 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25510 event pairs, 1434 based on Foata normal form. 2/4142 useless extension candidates. Maximal degree in co-relation 18627. Up to 3105 conditions per place. [2022-12-13 01:31:32,048 INFO L137 encePairwiseOnDemand]: 40/54 looper letters, 143 selfloop transitions, 15 changer transitions 16/174 dead transitions. [2022-12-13 01:31:32,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 174 transitions, 1958 flow [2022-12-13 01:31:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:31:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:31:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-13 01:31:32,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2242798353909465 [2022-12-13 01:31:32,050 INFO L175 Difference]: Start difference. First operand has 91 places, 112 transitions, 1221 flow. Second operand 9 states and 109 transitions. [2022-12-13 01:31:32,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 174 transitions, 1958 flow [2022-12-13 01:31:32,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 174 transitions, 1828 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 01:31:32,190 INFO L231 Difference]: Finished difference. Result has 95 places, 106 transitions, 1059 flow [2022-12-13 01:31:32,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1059, PETRI_PLACES=95, PETRI_TRANSITIONS=106} [2022-12-13 01:31:32,191 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2022-12-13 01:31:32,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:32,191 INFO L89 Accepts]: Start accepts. Operand has 95 places, 106 transitions, 1059 flow [2022-12-13 01:31:32,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:32,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:32,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 106 transitions, 1059 flow [2022-12-13 01:31:32,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 106 transitions, 1059 flow [2022-12-13 01:31:32,258 INFO L130 PetriNetUnfolder]: 108/552 cut-off events. [2022-12-13 01:31:32,258 INFO L131 PetriNetUnfolder]: For 3475/3613 co-relation queries the response was YES. [2022-12-13 01:31:32,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 552 events. 108/552 cut-off events. For 3475/3613 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4357 event pairs, 6 based on Foata normal form. 14/513 useless extension candidates. Maximal degree in co-relation 1911. Up to 77 conditions per place. [2022-12-13 01:31:32,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 106 transitions, 1059 flow [2022-12-13 01:31:32,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-13 01:31:32,480 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:32,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-13 01:31:32,481 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 1056 flow [2022-12-13 01:31:32,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:32,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:32,481 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, 1, 1, 1] [2022-12-13 01:31:32,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 01:31:32,481 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 01:31:32,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1317551597, now seen corresponding path program 5 times [2022-12-13 01:31:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:32,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093687215] [2022-12-13 01:31:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:33,116 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 01:31:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:33,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093687215] [2022-12-13 01:31:33,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093687215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:33,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:33,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:31:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97419049] [2022-12-13 01:31:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:33,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:31:33,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:33,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:31:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:31:33,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 01:31:33,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 1056 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:33,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:33,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 01:31:33,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:34,192 INFO L130 PetriNetUnfolder]: 2576/4317 cut-off events. [2022-12-13 01:31:34,192 INFO L131 PetriNetUnfolder]: For 27748/27748 co-relation queries the response was YES. [2022-12-13 01:31:34,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18021 conditions, 4317 events. 2576/4317 cut-off events. For 27748/27748 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 25592 event pairs, 1566 based on Foata normal form. 2/4164 useless extension candidates. Maximal degree in co-relation 17967. Up to 3706 conditions per place. [2022-12-13 01:31:34,220 INFO L137 encePairwiseOnDemand]: 42/55 looper letters, 105 selfloop transitions, 35 changer transitions 16/156 dead transitions. [2022-12-13 01:31:34,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 156 transitions, 1729 flow [2022-12-13 01:31:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:31:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:31:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-12-13 01:31:34,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17851239669421487 [2022-12-13 01:31:34,221 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 1056 flow. Second operand 11 states and 108 transitions. [2022-12-13 01:31:34,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 156 transitions, 1729 flow [2022-12-13 01:31:34,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 156 transitions, 1641 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-12-13 01:31:34,352 INFO L231 Difference]: Finished difference. Result has 99 places, 117 transitions, 1282 flow [2022-12-13 01:31:34,353 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1282, PETRI_PLACES=99, PETRI_TRANSITIONS=117} [2022-12-13 01:31:34,353 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2022-12-13 01:31:34,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:34,353 INFO L89 Accepts]: Start accepts. Operand has 99 places, 117 transitions, 1282 flow [2022-12-13 01:31:34,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:34,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:34,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 117 transitions, 1282 flow [2022-12-13 01:31:34,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 117 transitions, 1282 flow [2022-12-13 01:31:34,444 INFO L130 PetriNetUnfolder]: 121/592 cut-off events. [2022-12-13 01:31:34,444 INFO L131 PetriNetUnfolder]: For 4807/4964 co-relation queries the response was YES. [2022-12-13 01:31:34,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 592 events. 121/592 cut-off events. For 4807/4964 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4730 event pairs, 4 based on Foata normal form. 11/551 useless extension candidates. Maximal degree in co-relation 2264. Up to 89 conditions per place. [2022-12-13 01:31:34,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 117 transitions, 1282 flow [2022-12-13 01:31:34,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 01:31:34,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:34,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:34,825 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:35,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:35,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:35,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1873] L52-->L103-3: Formula: (and (= (select (select |v_#memory_int_1203| v_~get_5~0.base_306) (+ (* v_~id_3~0_454 4) v_~get_5~0.offset_297)) |v_thread1Thread1of1ForFork1_minus_#in~b#1_129|) (= |v_ULTIMATE.start_main_#t~pre50#1_374| |v_#pthreadsForks_839|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_155| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_155| |v_thread1Thread1of1ForFork1_minus_#res#1_149|)) (= (mod (select (select |v_#memory_int_1203| v_~contains_key_1~0.base_289) (+ v_~id_0~0_445 v_~contains_key_1~0.offset_240)) 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_115| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_115| 0) (= |v_thread1Thread1of1ForFork1_minus_~b#1_155| |v_thread1Thread1of1ForFork1_minus_#in~b#1_129|) (= (store |v_#memory_int_1203| |v_ULTIMATE.start_main_~#t3~0#1.base_434| (store (select |v_#memory_int_1203| |v_ULTIMATE.start_main_~#t3~0#1.base_434|) |v_ULTIMATE.start_main_~#t3~0#1.offset_380| |v_ULTIMATE.start_main_#t~pre50#1_374|)) |v_#memory_int_1202|) (<= 0 (+ v_~result_9~0_183 2147483648)) (not |v_thread1Thread1of1ForFork1_#t~short5#1_352|) (= (+ |v_#pthreadsForks_839| 1) |v_#pthreadsForks_838|) (<= v_~result_9~0_183 2147483647) (= v_~result_9~0_183 |v_thread1Thread1of1ForFork1_minus_#res#1_149|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_131| (select (select |v_#memory_int_1203| v_~get_2~0.base_357) (+ v_~get_2~0.offset_316 (* v_~id_0~0_445 4)))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_131| |v_thread1Thread1of1ForFork1_minus_~a#1_155|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_155|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_155| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_155| 2147483647))) 1 0))) InVars {~get_2~0.offset=v_~get_2~0.offset_316, #pthreadsForks=|v_#pthreadsForks_839|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_380|, ~get_5~0.base=v_~get_5~0.base_306, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_240, ~id_3~0=v_~id_3~0_454, ~get_2~0.base=v_~get_2~0.base_357, #memory_int=|v_#memory_int_1203|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_434|, ~id_0~0=v_~id_0~0_445, ~get_5~0.offset=v_~get_5~0.offset_297, ~contains_key_1~0.base=v_~contains_key_1~0.base_289} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_131|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_443|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_242|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_380|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_434|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_143|, ~result_9~0=v_~result_9~0_183, ~contains_key_1~0.base=v_~contains_key_1~0.base_289, #pthreadsForks=|v_#pthreadsForks_838|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_141|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_374|, ~id_3~0=v_~id_3~0_454, ~get_2~0.base=v_~get_2~0.base_357, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_176|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_351|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_115|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_147|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_115|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_150|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_149|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_354|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_129|, ~get_2~0.offset=v_~get_2~0.offset_316, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_155|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165|, ~get_5~0.base=v_~get_5~0.base_306, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_240, #memory_int=|v_#memory_int_1202|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_155|, ~id_0~0=v_~id_0~0_445, ~get_5~0.offset=v_~get_5~0.offset_297} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_352|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:35,998 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:31:35,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1646 [2022-12-13 01:31:35,999 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1351 flow [2022-12-13 01:31:35,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:35,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:35,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, 1, 1, 1] [2022-12-13 01:31:35,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 01:31:35,999 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 01:31:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1543839475, now seen corresponding path program 1 times [2022-12-13 01:31:36,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:36,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941521375] [2022-12-13 01:31:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:36,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:36,469 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 01:31:36,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:36,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941521375] [2022-12-13 01:31:36,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941521375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:36,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:36,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:36,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873260418] [2022-12-13 01:31:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:36,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:31:36,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:31:36,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:31:36,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 01:31:36,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1351 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:36,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:36,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 01:31:36,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:37,378 INFO L130 PetriNetUnfolder]: 2839/4862 cut-off events. [2022-12-13 01:31:37,379 INFO L131 PetriNetUnfolder]: For 37055/37055 co-relation queries the response was YES. [2022-12-13 01:31:37,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21344 conditions, 4862 events. 2839/4862 cut-off events. For 37055/37055 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 30602 event pairs, 1705 based on Foata normal form. 1/4708 useless extension candidates. Maximal degree in co-relation 21287. Up to 4143 conditions per place. [2022-12-13 01:31:37,409 INFO L137 encePairwiseOnDemand]: 46/63 looper letters, 159 selfloop transitions, 24 changer transitions 9/192 dead transitions. [2022-12-13 01:31:37,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 192 transitions, 2365 flow [2022-12-13 01:31:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:31:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:31:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-12-13 01:31:37,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3306878306878307 [2022-12-13 01:31:37,411 INFO L175 Difference]: Start difference. First operand has 94 places, 115 transitions, 1351 flow. Second operand 6 states and 125 transitions. [2022-12-13 01:31:37,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 192 transitions, 2365 flow [2022-12-13 01:31:37,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 192 transitions, 2224 flow, removed 44 selfloop flow, removed 7 redundant places. [2022-12-13 01:31:37,586 INFO L231 Difference]: Finished difference. Result has 96 places, 124 transitions, 1479 flow [2022-12-13 01:31:37,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1479, PETRI_PLACES=96, PETRI_TRANSITIONS=124} [2022-12-13 01:31:37,587 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2022-12-13 01:31:37,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:37,587 INFO L89 Accepts]: Start accepts. Operand has 96 places, 124 transitions, 1479 flow [2022-12-13 01:31:37,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:37,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:37,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 124 transitions, 1479 flow [2022-12-13 01:31:37,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 124 transitions, 1479 flow [2022-12-13 01:31:37,684 INFO L130 PetriNetUnfolder]: 126/703 cut-off events. [2022-12-13 01:31:37,685 INFO L131 PetriNetUnfolder]: For 5949/6161 co-relation queries the response was YES. [2022-12-13 01:31:37,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2756 conditions, 703 events. 126/703 cut-off events. For 5949/6161 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6138 event pairs, 4 based on Foata normal form. 17/669 useless extension candidates. Maximal degree in co-relation 2713. Up to 104 conditions per place. [2022-12-13 01:31:37,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 124 transitions, 1479 flow [2022-12-13 01:31:37,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 1082 [2022-12-13 01:31:37,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:31:38,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:38,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 689 [2022-12-13 01:31:38,276 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 124 transitions, 1492 flow [2022-12-13 01:31:38,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:38,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:38,277 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, 1] [2022-12-13 01:31:38,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 01:31:38,277 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 01:31:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 801971697, now seen corresponding path program 1 times [2022-12-13 01:31:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:38,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362098046] [2022-12-13 01:31:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:38,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:38,918 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 01:31:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362098046] [2022-12-13 01:31:38,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362098046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:38,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:38,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:31:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544280563] [2022-12-13 01:31:38,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:38,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:31:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:31:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:31:38,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 01:31:38,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 124 transitions, 1492 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:31:38,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:38,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 01:31:38,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:39,774 INFO L130 PetriNetUnfolder]: 2835/4876 cut-off events. [2022-12-13 01:31:39,775 INFO L131 PetriNetUnfolder]: For 38274/38274 co-relation queries the response was YES. [2022-12-13 01:31:39,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21600 conditions, 4876 events. 2835/4876 cut-off events. For 38274/38274 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 30877 event pairs, 1771 based on Foata normal form. 2/4722 useless extension candidates. Maximal degree in co-relation 21545. Up to 4230 conditions per place. [2022-12-13 01:31:39,803 INFO L137 encePairwiseOnDemand]: 46/64 looper letters, 104 selfloop transitions, 31 changer transitions 16/151 dead transitions. [2022-12-13 01:31:39,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 151 transitions, 1930 flow [2022-12-13 01:31:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:31:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:31:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-13 01:31:39,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21205357142857142 [2022-12-13 01:31:39,804 INFO L175 Difference]: Start difference. First operand has 95 places, 124 transitions, 1492 flow. Second operand 7 states and 95 transitions. [2022-12-13 01:31:39,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 151 transitions, 1930 flow [2022-12-13 01:31:39,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 151 transitions, 1904 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:31:39,950 INFO L231 Difference]: Finished difference. Result has 101 places, 122 transitions, 1481 flow [2022-12-13 01:31:39,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1481, PETRI_PLACES=101, PETRI_TRANSITIONS=122} [2022-12-13 01:31:39,950 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2022-12-13 01:31:39,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:39,950 INFO L89 Accepts]: Start accepts. Operand has 101 places, 122 transitions, 1481 flow [2022-12-13 01:31:39,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:39,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:39,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 122 transitions, 1481 flow [2022-12-13 01:31:39,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 122 transitions, 1481 flow [2022-12-13 01:31:40,019 INFO L130 PetriNetUnfolder]: 123/699 cut-off events. [2022-12-13 01:31:40,020 INFO L131 PetriNetUnfolder]: For 6373/6585 co-relation queries the response was YES. [2022-12-13 01:31:40,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 699 events. 123/699 cut-off events. For 6373/6585 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6100 event pairs, 4 based on Foata normal form. 17/666 useless extension candidates. Maximal degree in co-relation 2766. Up to 97 conditions per place. [2022-12-13 01:31:40,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 122 transitions, 1481 flow [2022-12-13 01:31:40,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 1076 [2022-12-13 01:31:40,027 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:40,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 01:31:40,029 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 1481 flow [2022-12-13 01:31:40,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:31:40,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:40,029 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, 1, 1] [2022-12-13 01:31:40,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 01:31:40,029 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 01:31:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash -912265409, now seen corresponding path program 1 times [2022-12-13 01:31:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:40,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511321918] [2022-12-13 01:31:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:41,074 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 01:31:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:41,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511321918] [2022-12-13 01:31:41,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511321918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:41,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:41,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:31:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692898810] [2022-12-13 01:31:41,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:41,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:31:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:31:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:31:41,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 01:31:41,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 1481 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 01:31:41,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:41,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 01:31:41,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:42,082 INFO L130 PetriNetUnfolder]: 2834/4897 cut-off events. [2022-12-13 01:31:42,082 INFO L131 PetriNetUnfolder]: For 41188/41188 co-relation queries the response was YES. [2022-12-13 01:31:42,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22172 conditions, 4897 events. 2834/4897 cut-off events. For 41188/41188 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 31175 event pairs, 1770 based on Foata normal form. 2/4744 useless extension candidates. Maximal degree in co-relation 22114. Up to 4221 conditions per place. [2022-12-13 01:31:42,103 INFO L137 encePairwiseOnDemand]: 45/62 looper letters, 112 selfloop transitions, 34 changer transitions 23/169 dead transitions. [2022-12-13 01:31:42,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 169 transitions, 2072 flow [2022-12-13 01:31:42,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:31:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:31:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-12-13 01:31:42,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18548387096774194 [2022-12-13 01:31:42,104 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 1481 flow. Second operand 10 states and 115 transitions. [2022-12-13 01:31:42,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 169 transitions, 2072 flow [2022-12-13 01:31:42,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 169 transitions, 1998 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 01:31:42,217 INFO L231 Difference]: Finished difference. Result has 107 places, 125 transitions, 1553 flow [2022-12-13 01:31:42,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1553, PETRI_PLACES=107, PETRI_TRANSITIONS=125} [2022-12-13 01:31:42,217 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2022-12-13 01:31:42,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:42,218 INFO L89 Accepts]: Start accepts. Operand has 107 places, 125 transitions, 1553 flow [2022-12-13 01:31:42,219 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:42,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:42,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 125 transitions, 1553 flow [2022-12-13 01:31:42,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 125 transitions, 1553 flow [2022-12-13 01:31:42,306 INFO L130 PetriNetUnfolder]: 121/712 cut-off events. [2022-12-13 01:31:42,307 INFO L131 PetriNetUnfolder]: For 6698/6919 co-relation queries the response was YES. [2022-12-13 01:31:42,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2915 conditions, 712 events. 121/712 cut-off events. For 6698/6919 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6307 event pairs, 4 based on Foata normal form. 18/679 useless extension candidates. Maximal degree in co-relation 2866. Up to 99 conditions per place. [2022-12-13 01:31:42,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 125 transitions, 1553 flow [2022-12-13 01:31:42,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 1080 [2022-12-13 01:31:42,317 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:42,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 01:31:42,318 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 125 transitions, 1553 flow [2022-12-13 01:31:42,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 01:31:42,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:42,318 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, 1, 1, 1] [2022-12-13 01:31:42,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 01:31:42,318 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 01:31:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1027102181, now seen corresponding path program 2 times [2022-12-13 01:31:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:42,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178673845] [2022-12-13 01:31:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:42,894 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 01:31:42,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178673845] [2022-12-13 01:31:42,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178673845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:42,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:42,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516250876] [2022-12-13 01:31:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:42,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:31:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:31:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:31:42,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 01:31:42,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 125 transitions, 1553 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:42,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:42,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 01:31:42,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:43,776 INFO L130 PetriNetUnfolder]: 2824/4864 cut-off events. [2022-12-13 01:31:43,777 INFO L131 PetriNetUnfolder]: For 41031/41031 co-relation queries the response was YES. [2022-12-13 01:31:43,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22161 conditions, 4864 events. 2824/4864 cut-off events. For 41031/41031 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31156 event pairs, 703 based on Foata normal form. 2/4711 useless extension candidates. Maximal degree in co-relation 22100. Up to 1962 conditions per place. [2022-12-13 01:31:43,796 INFO L137 encePairwiseOnDemand]: 48/62 looper letters, 144 selfloop transitions, 34 changer transitions 11/189 dead transitions. [2022-12-13 01:31:43,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 189 transitions, 2274 flow [2022-12-13 01:31:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:31:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:31:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-12-13 01:31:43,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2022-12-13 01:31:43,797 INFO L175 Difference]: Start difference. First operand has 104 places, 125 transitions, 1553 flow. Second operand 6 states and 128 transitions. [2022-12-13 01:31:43,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 189 transitions, 2274 flow [2022-12-13 01:31:43,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 189 transitions, 2175 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-13 01:31:43,909 INFO L231 Difference]: Finished difference. Result has 104 places, 124 transitions, 1540 flow [2022-12-13 01:31:43,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1540, PETRI_PLACES=104, PETRI_TRANSITIONS=124} [2022-12-13 01:31:43,909 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2022-12-13 01:31:43,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:43,910 INFO L89 Accepts]: Start accepts. Operand has 104 places, 124 transitions, 1540 flow [2022-12-13 01:31:43,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:43,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:43,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 124 transitions, 1540 flow [2022-12-13 01:31:43,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 124 transitions, 1540 flow [2022-12-13 01:31:43,970 INFO L130 PetriNetUnfolder]: 119/690 cut-off events. [2022-12-13 01:31:43,970 INFO L131 PetriNetUnfolder]: For 6570/6789 co-relation queries the response was YES. [2022-12-13 01:31:43,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 690 events. 119/690 cut-off events. For 6570/6789 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6035 event pairs, 4 based on Foata normal form. 16/654 useless extension candidates. Maximal degree in co-relation 2737. Up to 91 conditions per place. [2022-12-13 01:31:43,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 124 transitions, 1540 flow [2022-12-13 01:31:43,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-13 01:31:43,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1878] L52-->thread1EXIT: Formula: (and (= (mod (select (select |v_#memory_int_1216| v_~contains_key_1~0.base_299) (+ v_~id_0~0_455 v_~contains_key_1~0.offset_250)) 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_159| |v_thread1Thread1of1ForFork1_minus_#res#1_153|) |v_thread1Thread1of1ForFork1_minus_~a#1_159|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_133| (select (select |v_#memory_int_1216| v_~get_5~0.base_310) (+ (* v_~id_3~0_458 4) v_~get_5~0.offset_301))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_159|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_159| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_159| 2147483647))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_135| |v_thread1Thread1of1ForFork1_minus_~a#1_159|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_119| 0) (<= v_~result_9~0_187 2147483647) (= v_~result_9~0_187 |v_thread1Thread1of1ForFork1_minus_#res#1_153|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_159| |v_thread1Thread1of1ForFork1_minus_#in~b#1_133|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_366|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_135| (select (select |v_#memory_int_1216| v_~get_2~0.base_363) (+ v_~get_2~0.offset_322 (* v_~id_0~0_455 4)))) (<= 0 (+ v_~result_9~0_187 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_119| 0)) InVars {~get_2~0.offset=v_~get_2~0.offset_322, ~get_5~0.base=v_~get_5~0.base_310, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_250, ~id_3~0=v_~id_3~0_458, #memory_int=|v_#memory_int_1216|, ~get_2~0.base=v_~get_2~0.base_363, ~id_0~0=v_~id_0~0_455, ~get_5~0.offset=v_~get_5~0.offset_301, ~contains_key_1~0.base=v_~contains_key_1~0.base_299} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_135|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_248|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_147|, ~result_9~0=v_~result_9~0_187, ~contains_key_1~0.base=v_~contains_key_1~0.base_299, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_145|, ~id_3~0=v_~id_3~0_458, ~get_2~0.base=v_~get_2~0.base_363, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_190|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_365|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_119|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_151|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_119|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_154|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_153|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_133|, ~get_2~0.offset=v_~get_2~0.offset_322, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_159|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169|, ~get_5~0.base=v_~get_5~0.base_310, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_250, #memory_int=|v_#memory_int_1216|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_159|, ~id_0~0=v_~id_0~0_455, ~get_5~0.offset=v_~get_5~0.offset_301} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_366|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:44,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1878] L52-->thread1EXIT: Formula: (and (= (mod (select (select |v_#memory_int_1216| v_~contains_key_1~0.base_299) (+ v_~id_0~0_455 v_~contains_key_1~0.offset_250)) 256) 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_159| |v_thread1Thread1of1ForFork1_minus_#res#1_153|) |v_thread1Thread1of1ForFork1_minus_~a#1_159|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_133| (select (select |v_#memory_int_1216| v_~get_5~0.base_310) (+ (* v_~id_3~0_458 4) v_~get_5~0.offset_301))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_159|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_159| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_159| 2147483647))) 1 0)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_135| |v_thread1Thread1of1ForFork1_minus_~a#1_159|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_119| 0) (<= v_~result_9~0_187 2147483647) (= v_~result_9~0_187 |v_thread1Thread1of1ForFork1_minus_#res#1_153|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_159| |v_thread1Thread1of1ForFork1_minus_#in~b#1_133|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_366|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_135| (select (select |v_#memory_int_1216| v_~get_2~0.base_363) (+ v_~get_2~0.offset_322 (* v_~id_0~0_455 4)))) (<= 0 (+ v_~result_9~0_187 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_119| 0)) InVars {~get_2~0.offset=v_~get_2~0.offset_322, ~get_5~0.base=v_~get_5~0.base_310, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_250, ~id_3~0=v_~id_3~0_458, #memory_int=|v_#memory_int_1216|, ~get_2~0.base=v_~get_2~0.base_363, ~id_0~0=v_~id_0~0_455, ~get_5~0.offset=v_~get_5~0.offset_301, ~contains_key_1~0.base=v_~contains_key_1~0.base_299} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_135|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_248|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_147|, ~result_9~0=v_~result_9~0_187, ~contains_key_1~0.base=v_~contains_key_1~0.base_299, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_145|, ~id_3~0=v_~id_3~0_458, ~get_2~0.base=v_~get_2~0.base_363, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_190|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_365|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_119|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_151|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_119|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_154|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_153|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_133|, ~get_2~0.offset=v_~get_2~0.offset_322, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_159|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169|, ~get_5~0.base=v_~get_5~0.base_310, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_250, #memory_int=|v_#memory_int_1216|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_159|, ~id_0~0=v_~id_0~0_455, ~get_5~0.offset=v_~get_5~0.offset_301} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_366|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:44,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:44,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 551 [2022-12-13 01:31:44,461 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 124 transitions, 1576 flow [2022-12-13 01:31:44,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:44,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:44,461 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, 1, 1, 1] [2022-12-13 01:31:44,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 01:31:44,462 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 01:31:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1140273236, now seen corresponding path program 1 times [2022-12-13 01:31:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:44,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658199562] [2022-12-13 01:31:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:44,883 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 01:31:44,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:44,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658199562] [2022-12-13 01:31:44,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658199562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:44,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:44,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576254698] [2022-12-13 01:31:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:44,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:31:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:31:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:31:44,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 01:31:44,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 124 transitions, 1576 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:44,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:44,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 01:31:44,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:45,640 INFO L130 PetriNetUnfolder]: 2802/4813 cut-off events. [2022-12-13 01:31:45,640 INFO L131 PetriNetUnfolder]: For 44926/44926 co-relation queries the response was YES. [2022-12-13 01:31:45,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22104 conditions, 4813 events. 2802/4813 cut-off events. For 44926/44926 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30264 event pairs, 1732 based on Foata normal form. 1/4658 useless extension candidates. Maximal degree in co-relation 22046. Up to 4129 conditions per place. [2022-12-13 01:31:45,665 INFO L137 encePairwiseOnDemand]: 45/62 looper letters, 128 selfloop transitions, 27 changer transitions 12/167 dead transitions. [2022-12-13 01:31:45,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 167 transitions, 2243 flow [2022-12-13 01:31:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:31:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:31:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-13 01:31:45,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27956989247311825 [2022-12-13 01:31:45,667 INFO L175 Difference]: Start difference. First operand has 102 places, 124 transitions, 1576 flow. Second operand 6 states and 104 transitions. [2022-12-13 01:31:45,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 167 transitions, 2243 flow [2022-12-13 01:31:45,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 167 transitions, 2186 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 01:31:45,792 INFO L231 Difference]: Finished difference. Result has 105 places, 129 transitions, 1699 flow [2022-12-13 01:31:45,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1699, PETRI_PLACES=105, PETRI_TRANSITIONS=129} [2022-12-13 01:31:45,793 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2022-12-13 01:31:45,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:45,793 INFO L89 Accepts]: Start accepts. Operand has 105 places, 129 transitions, 1699 flow [2022-12-13 01:31:45,794 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:45,794 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:45,794 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 129 transitions, 1699 flow [2022-12-13 01:31:45,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 129 transitions, 1699 flow [2022-12-13 01:31:45,884 INFO L130 PetriNetUnfolder]: 119/680 cut-off events. [2022-12-13 01:31:45,884 INFO L131 PetriNetUnfolder]: For 6747/7007 co-relation queries the response was YES. [2022-12-13 01:31:45,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 680 events. 119/680 cut-off events. For 6747/7007 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5876 event pairs, 4 based on Foata normal form. 18/648 useless extension candidates. Maximal degree in co-relation 2830. Up to 90 conditions per place. [2022-12-13 01:31:45,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 129 transitions, 1699 flow [2022-12-13 01:31:45,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 1102 [2022-12-13 01:31:45,893 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:45,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 01:31:45,894 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 129 transitions, 1699 flow [2022-12-13 01:31:45,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:45,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:45,894 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, 1, 1] [2022-12-13 01:31:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 01:31:45,894 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 01:31:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1927345187, now seen corresponding path program 1 times [2022-12-13 01:31:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:45,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761060586] [2022-12-13 01:31:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:46,281 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 01:31:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:46,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761060586] [2022-12-13 01:31:46,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761060586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:46,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:46,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:31:46,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313174160] [2022-12-13 01:31:46,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:46,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:31:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:46,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:31:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:31:46,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 01:31:46,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 129 transitions, 1699 flow. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 01:31:46,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:46,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 01:31:46,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:47,115 INFO L130 PetriNetUnfolder]: 2795/4794 cut-off events. [2022-12-13 01:31:47,115 INFO L131 PetriNetUnfolder]: For 44394/44394 co-relation queries the response was YES. [2022-12-13 01:31:47,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22406 conditions, 4794 events. 2795/4794 cut-off events. For 44394/44394 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30481 event pairs, 653 based on Foata normal form. 1/4639 useless extension candidates. Maximal degree in co-relation 22349. Up to 2055 conditions per place. [2022-12-13 01:31:47,140 INFO L137 encePairwiseOnDemand]: 47/60 looper letters, 127 selfloop transitions, 43 changer transitions 7/177 dead transitions. [2022-12-13 01:31:47,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 177 transitions, 2251 flow [2022-12-13 01:31:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:31:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:31:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-12-13 01:31:47,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 01:31:47,141 INFO L175 Difference]: Start difference. First operand has 102 places, 129 transitions, 1699 flow. Second operand 5 states and 120 transitions. [2022-12-13 01:31:47,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 177 transitions, 2251 flow [2022-12-13 01:31:47,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 177 transitions, 2186 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 01:31:47,272 INFO L231 Difference]: Finished difference. Result has 103 places, 128 transitions, 1691 flow [2022-12-13 01:31:47,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1691, PETRI_PLACES=103, PETRI_TRANSITIONS=128} [2022-12-13 01:31:47,273 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2022-12-13 01:31:47,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:47,273 INFO L89 Accepts]: Start accepts. Operand has 103 places, 128 transitions, 1691 flow [2022-12-13 01:31:47,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:47,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:47,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 128 transitions, 1691 flow [2022-12-13 01:31:47,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 128 transitions, 1691 flow [2022-12-13 01:31:47,334 INFO L130 PetriNetUnfolder]: 118/674 cut-off events. [2022-12-13 01:31:47,334 INFO L131 PetriNetUnfolder]: For 6549/6809 co-relation queries the response was YES. [2022-12-13 01:31:47,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 674 events. 118/674 cut-off events. For 6549/6809 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5803 event pairs, 5 based on Foata normal form. 18/641 useless extension candidates. Maximal degree in co-relation 2831. Up to 89 conditions per place. [2022-12-13 01:31:47,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 128 transitions, 1691 flow [2022-12-13 01:31:47,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 1100 [2022-12-13 01:31:47,354 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:47,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 01:31:47,355 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 128 transitions, 1691 flow [2022-12-13 01:31:47,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 01:31:47,355 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:47,355 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, 1, 1] [2022-12-13 01:31:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 01:31:47,355 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 01:31:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1084961724, now seen corresponding path program 1 times [2022-12-13 01:31:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:47,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310571845] [2022-12-13 01:31:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:47,711 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 01:31:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:47,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310571845] [2022-12-13 01:31:47,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310571845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:47,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:47,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:31:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948080683] [2022-12-13 01:31:47,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:47,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:31:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:31:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:31:47,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:31:47,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 128 transitions, 1691 flow. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 01:31:47,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:47,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:31:47,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:48,551 INFO L130 PetriNetUnfolder]: 2794/4785 cut-off events. [2022-12-13 01:31:48,551 INFO L131 PetriNetUnfolder]: For 48780/48780 co-relation queries the response was YES. [2022-12-13 01:31:48,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22758 conditions, 4785 events. 2794/4785 cut-off events. For 48780/48780 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 30023 event pairs, 1278 based on Foata normal form. 1/4630 useless extension candidates. Maximal degree in co-relation 22702. Up to 3629 conditions per place. [2022-12-13 01:31:48,572 INFO L137 encePairwiseOnDemand]: 38/59 looper letters, 118 selfloop transitions, 52 changer transitions 7/177 dead transitions. [2022-12-13 01:31:48,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 177 transitions, 2264 flow [2022-12-13 01:31:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:31:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:31:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-13 01:31:48,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3418079096045198 [2022-12-13 01:31:48,576 INFO L175 Difference]: Start difference. First operand has 102 places, 128 transitions, 1691 flow. Second operand 6 states and 121 transitions. [2022-12-13 01:31:48,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 177 transitions, 2264 flow [2022-12-13 01:31:48,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 177 transitions, 2174 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 01:31:48,698 INFO L231 Difference]: Finished difference. Result has 104 places, 127 transitions, 1677 flow [2022-12-13 01:31:48,698 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1677, PETRI_PLACES=104, PETRI_TRANSITIONS=127} [2022-12-13 01:31:48,698 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2022-12-13 01:31:48,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:48,698 INFO L89 Accepts]: Start accepts. Operand has 104 places, 127 transitions, 1677 flow [2022-12-13 01:31:48,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:48,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:48,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 127 transitions, 1677 flow [2022-12-13 01:31:48,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 127 transitions, 1677 flow [2022-12-13 01:31:48,763 INFO L130 PetriNetUnfolder]: 118/667 cut-off events. [2022-12-13 01:31:48,763 INFO L131 PetriNetUnfolder]: For 6474/6745 co-relation queries the response was YES. [2022-12-13 01:31:48,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 667 events. 118/667 cut-off events. For 6474/6745 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5732 event pairs, 5 based on Foata normal form. 18/634 useless extension candidates. Maximal degree in co-relation 2840. Up to 88 conditions per place. [2022-12-13 01:31:48,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 127 transitions, 1677 flow [2022-12-13 01:31:48,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 1098 [2022-12-13 01:31:48,780 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:48,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 01:31:48,781 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 127 transitions, 1677 flow [2022-12-13 01:31:48,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 01:31:48,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:48,781 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, 1, 1, 1] [2022-12-13 01:31:48,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 01:31:48,782 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 01:31:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash -406885887, now seen corresponding path program 1 times [2022-12-13 01:31:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:48,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55218390] [2022-12-13 01:31:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:49,219 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 01:31:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:49,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55218390] [2022-12-13 01:31:49,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55218390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:49,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:49,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923395310] [2022-12-13 01:31:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:31:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:31:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:31:49,221 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 01:31:49,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 127 transitions, 1677 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:49,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:49,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 01:31:49,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:50,034 INFO L130 PetriNetUnfolder]: 2793/4776 cut-off events. [2022-12-13 01:31:50,034 INFO L131 PetriNetUnfolder]: For 45753/45753 co-relation queries the response was YES. [2022-12-13 01:31:50,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22610 conditions, 4776 events. 2793/4776 cut-off events. For 45753/45753 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 30286 event pairs, 653 based on Foata normal form. 1/4621 useless extension candidates. Maximal degree in co-relation 22554. Up to 2034 conditions per place. [2022-12-13 01:31:50,062 INFO L137 encePairwiseOnDemand]: 45/58 looper letters, 126 selfloop transitions, 42 changer transitions 9/177 dead transitions. [2022-12-13 01:31:50,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 177 transitions, 2249 flow [2022-12-13 01:31:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:31:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:31:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-13 01:31:50,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 01:31:50,064 INFO L175 Difference]: Start difference. First operand has 103 places, 127 transitions, 1677 flow. Second operand 6 states and 120 transitions. [2022-12-13 01:31:50,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 177 transitions, 2249 flow [2022-12-13 01:31:50,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 177 transitions, 2141 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 01:31:50,196 INFO L231 Difference]: Finished difference. Result has 105 places, 126 transitions, 1629 flow [2022-12-13 01:31:50,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1629, PETRI_PLACES=105, PETRI_TRANSITIONS=126} [2022-12-13 01:31:50,197 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2022-12-13 01:31:50,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:50,197 INFO L89 Accepts]: Start accepts. Operand has 105 places, 126 transitions, 1629 flow [2022-12-13 01:31:50,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:50,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:50,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 126 transitions, 1629 flow [2022-12-13 01:31:50,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 126 transitions, 1629 flow [2022-12-13 01:31:50,261 INFO L130 PetriNetUnfolder]: 118/659 cut-off events. [2022-12-13 01:31:50,261 INFO L131 PetriNetUnfolder]: For 6402/6662 co-relation queries the response was YES. [2022-12-13 01:31:50,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 659 events. 118/659 cut-off events. For 6402/6662 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5615 event pairs, 5 based on Foata normal form. 18/626 useless extension candidates. Maximal degree in co-relation 2775. Up to 88 conditions per place. [2022-12-13 01:31:50,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 126 transitions, 1629 flow [2022-12-13 01:31:50,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-13 01:31:50,276 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:50,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 01:31:50,276 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 1629 flow [2022-12-13 01:31:50,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:50,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:50,277 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, 1, 1, 1] [2022-12-13 01:31:50,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 01:31:50,277 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 01:31:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -872148936, now seen corresponding path program 1 times [2022-12-13 01:31:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043564297] [2022-12-13 01:31:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:50,684 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 01:31:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043564297] [2022-12-13 01:31:50,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043564297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:50,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:50,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:31:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593720534] [2022-12-13 01:31:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:50,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:31:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:50,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:31:50,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:31:50,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:31:50,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 1629 flow. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:50,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:50,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:31:50,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:51,604 INFO L130 PetriNetUnfolder]: 2791/4764 cut-off events. [2022-12-13 01:31:51,604 INFO L131 PetriNetUnfolder]: For 48594/48594 co-relation queries the response was YES. [2022-12-13 01:31:51,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22637 conditions, 4764 events. 2791/4764 cut-off events. For 48594/48594 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29778 event pairs, 1274 based on Foata normal form. 1/4609 useless extension candidates. Maximal degree in co-relation 22580. Up to 3605 conditions per place. [2022-12-13 01:31:51,628 INFO L137 encePairwiseOnDemand]: 37/57 looper letters, 117 selfloop transitions, 50 changer transitions 9/176 dead transitions. [2022-12-13 01:31:51,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 176 transitions, 2202 flow [2022-12-13 01:31:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:31:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:31:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-13 01:31:51,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3032581453634085 [2022-12-13 01:31:51,629 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 1629 flow. Second operand 7 states and 121 transitions. [2022-12-13 01:31:51,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 176 transitions, 2202 flow [2022-12-13 01:31:51,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 176 transitions, 2112 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 01:31:51,763 INFO L231 Difference]: Finished difference. Result has 105 places, 124 transitions, 1596 flow [2022-12-13 01:31:51,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1596, PETRI_PLACES=105, PETRI_TRANSITIONS=124} [2022-12-13 01:31:51,763 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2022-12-13 01:31:51,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:51,763 INFO L89 Accepts]: Start accepts. Operand has 105 places, 124 transitions, 1596 flow [2022-12-13 01:31:51,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:51,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:51,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 124 transitions, 1596 flow [2022-12-13 01:31:51,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 124 transitions, 1596 flow [2022-12-13 01:31:51,822 INFO L130 PetriNetUnfolder]: 118/651 cut-off events. [2022-12-13 01:31:51,822 INFO L131 PetriNetUnfolder]: For 6435/6716 co-relation queries the response was YES. [2022-12-13 01:31:51,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 651 events. 118/651 cut-off events. For 6435/6716 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5526 event pairs, 5 based on Foata normal form. 18/618 useless extension candidates. Maximal degree in co-relation 2774. Up to 88 conditions per place. [2022-12-13 01:31:51,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 124 transitions, 1596 flow [2022-12-13 01:31:51,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 1092 [2022-12-13 01:31:51,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1872] L52-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_69| v_~result_12~0_181) (= |v_thread2Thread1of1ForFork2_#res#1.offset_45| 0) (<= 0 (+ v_~result_12~0_181 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.base_45| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_69| |v_thread2Thread1of1ForFork2_minus_~b#1_79|) |v_thread2Thread1of1ForFork2_minus_~a#1_79|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_85|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_79|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_79| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_79|))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_79| |v_thread2Thread1of1ForFork2_minus_#in~a#1_55|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_140| |v_thread2Thread1of1ForFork2_minus_#in~a#1_55|) (= (select (select |v_#memory_int_1200| v_~get_8~0.base_304) (+ (* v_~id_6~0_373 4) v_~get_8~0.offset_268)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_57|) (= |v_thread1Thread1of1ForFork1_#t~mem3#1_174| (select (select |v_#memory_int_1200| v_~contains_key_1~0.base_287) (+ v_~id_0~0_443 v_~contains_key_1~0.offset_238))) (<= v_~result_12~0_181 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_79| |v_thread2Thread1of1ForFork2_minus_#in~b#1_57|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_174| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_349|)) InVars {~id_6~0=v_~id_6~0_373, ~get_8~0.base=v_~get_8~0.base_304, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_238, ~get_8~0.offset=v_~get_8~0.offset_268, #memory_int=|v_#memory_int_1200|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_140|, ~id_0~0=v_~id_0~0_443, ~contains_key_1~0.base=v_~contains_key_1~0.base_287} OutVars{~id_6~0=v_~id_6~0_373, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_45|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_90|, ~get_8~0.base=v_~get_8~0.base_304, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_69|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_69|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_45|, ~contains_key_1~0.base=v_~contains_key_1~0.base_287, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_79|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_55|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_57|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_349|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_174|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_187|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_79|, ~get_8~0.offset=v_~get_8~0.offset_268, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_69|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_85|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_189|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_238, #memory_int=|v_#memory_int_1200|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_63|, ~result_12~0=v_~result_12~0_181, ~id_0~0=v_~id_0~0_443} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1857] L52-6-->L103-3: Formula: (and (= (select (select |v_#memory_int_579| v_~get_2~0.base_107) (+ (* v_~id_0~0_197 4) v_~get_2~0.offset_107)) |v_thread1Thread1of1ForFork1_#t~mem6#1_94|) (= |v_#memory_int_578| (store |v_#memory_int_579| |v_ULTIMATE.start_main_~#t3~0#1.base_143| (store (select |v_#memory_int_579| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) |v_ULTIMATE.start_main_~#t3~0#1.offset_139| |v_ULTIMATE.start_main_#t~pre50#1_133|))) (= |v_ULTIMATE.start_main_#t~pre50#1_133| |v_#pthreadsForks_295|) (= (+ |v_#pthreadsForks_295| 1) |v_#pthreadsForks_294|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_112|)) InVars {~get_2~0.offset=v_~get_2~0.offset_107, #pthreadsForks=|v_#pthreadsForks_295|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_139|, #memory_int=|v_#memory_int_579|, ~get_2~0.base=v_~get_2~0.base_107, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_112|, ~id_0~0=v_~id_0~0_197} OutVars{~get_2~0.offset=v_~get_2~0.offset_107, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_171|, #pthreadsForks=|v_#pthreadsForks_294|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_94|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_139|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_133|, #memory_int=|v_#memory_int_578|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_113|, ~get_2~0.base=v_~get_2~0.base_107, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_112|, ~id_0~0=v_~id_0~0_197} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:51,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1872] L52-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_69| v_~result_12~0_181) (= |v_thread2Thread1of1ForFork2_#res#1.offset_45| 0) (<= 0 (+ v_~result_12~0_181 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.base_45| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_69| |v_thread2Thread1of1ForFork2_minus_~b#1_79|) |v_thread2Thread1of1ForFork2_minus_~a#1_79|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_85|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_79|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_79| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_79|))) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_79| |v_thread2Thread1of1ForFork2_minus_#in~a#1_55|) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_140| |v_thread2Thread1of1ForFork2_minus_#in~a#1_55|) (= (select (select |v_#memory_int_1200| v_~get_8~0.base_304) (+ (* v_~id_6~0_373 4) v_~get_8~0.offset_268)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_57|) (= |v_thread1Thread1of1ForFork1_#t~mem3#1_174| (select (select |v_#memory_int_1200| v_~contains_key_1~0.base_287) (+ v_~id_0~0_443 v_~contains_key_1~0.offset_238))) (<= v_~result_12~0_181 2147483647) (= |v_thread2Thread1of1ForFork2_minus_~b#1_79| |v_thread2Thread1of1ForFork2_minus_#in~b#1_57|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_174| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_349|)) InVars {~id_6~0=v_~id_6~0_373, ~get_8~0.base=v_~get_8~0.base_304, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_238, ~get_8~0.offset=v_~get_8~0.offset_268, #memory_int=|v_#memory_int_1200|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_140|, ~id_0~0=v_~id_0~0_443, ~contains_key_1~0.base=v_~contains_key_1~0.base_287} OutVars{~id_6~0=v_~id_6~0_373, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_45|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_90|, ~get_8~0.base=v_~get_8~0.base_304, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_69|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_69|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_45|, ~contains_key_1~0.base=v_~contains_key_1~0.base_287, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_79|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_55|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_57|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_349|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_174|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_187|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_79|, ~get_8~0.offset=v_~get_8~0.offset_268, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_69|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_85|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_189|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_238, #memory_int=|v_#memory_int_1200|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_63|, ~result_12~0=v_~result_12~0_181, ~id_0~0=v_~id_0~0_443} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:52,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:31:52,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:31:52,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1416] L52-->L52-6: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_17| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_25|) (= (select (select |v_#memory_int_84| v_~contains_key_1~0.base_9) (+ v_~contains_key_1~0.offset_9 v_~id_0~0_33)) |v_thread1Thread1of1ForFork1_#t~mem3#1_17|)) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_9, #memory_int=|v_#memory_int_84|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_25|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_17|, ~id_0~0=v_~id_0~0_33, ~contains_key_1~0.base=v_~contains_key_1~0.base_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-13 01:31:52,906 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:31:52,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1144 [2022-12-13 01:31:52,907 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 123 transitions, 1674 flow [2022-12-13 01:31:52,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:52,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:52,907 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, 1, 1, 1] [2022-12-13 01:31:52,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 01:31:52,907 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 01:31:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -403574205, now seen corresponding path program 6 times [2022-12-13 01:31:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:52,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802536981] [2022-12-13 01:31:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:52,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:53,523 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 01:31:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802536981] [2022-12-13 01:31:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802536981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:31:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84569984] [2022-12-13 01:31:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:31:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:31:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:31:53,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 01:31:53,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 123 transitions, 1674 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:53,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:53,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 01:31:53,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:54,453 INFO L130 PetriNetUnfolder]: 2786/4751 cut-off events. [2022-12-13 01:31:54,453 INFO L131 PetriNetUnfolder]: For 47628/47628 co-relation queries the response was YES. [2022-12-13 01:31:54,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22660 conditions, 4751 events. 2786/4751 cut-off events. For 47628/47628 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 29497 event pairs, 1466 based on Foata normal form. 3/4598 useless extension candidates. Maximal degree in co-relation 22604. Up to 3105 conditions per place. [2022-12-13 01:31:54,487 INFO L137 encePairwiseOnDemand]: 41/62 looper letters, 131 selfloop transitions, 38 changer transitions 18/187 dead transitions. [2022-12-13 01:31:54,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 187 transitions, 2567 flow [2022-12-13 01:31:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:31:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:31:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2022-12-13 01:31:54,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17595307917888564 [2022-12-13 01:31:54,489 INFO L175 Difference]: Start difference. First operand has 101 places, 123 transitions, 1674 flow. Second operand 11 states and 120 transitions. [2022-12-13 01:31:54,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 187 transitions, 2567 flow [2022-12-13 01:31:54,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 187 transitions, 2403 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-13 01:31:54,630 INFO L231 Difference]: Finished difference. Result has 111 places, 136 transitions, 1925 flow [2022-12-13 01:31:54,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1925, PETRI_PLACES=111, PETRI_TRANSITIONS=136} [2022-12-13 01:31:54,630 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2022-12-13 01:31:54,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:54,630 INFO L89 Accepts]: Start accepts. Operand has 111 places, 136 transitions, 1925 flow [2022-12-13 01:31:54,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:54,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:54,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 136 transitions, 1925 flow [2022-12-13 01:31:54,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 136 transitions, 1925 flow [2022-12-13 01:31:54,691 INFO L130 PetriNetUnfolder]: 124/647 cut-off events. [2022-12-13 01:31:54,691 INFO L131 PetriNetUnfolder]: For 8528/9135 co-relation queries the response was YES. [2022-12-13 01:31:54,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 647 events. 124/647 cut-off events. For 8528/9135 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5407 event pairs, 4 based on Foata normal form. 15/615 useless extension candidates. Maximal degree in co-relation 2920. Up to 94 conditions per place. [2022-12-13 01:31:54,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 136 transitions, 1925 flow [2022-12-13 01:31:54,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-13 01:31:54,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1855] L52-6-->L103-3: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_36| 0) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_76|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_76| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_76|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|) (<= 0 (+ v_~result_9~0_104 2147483648)) (= |v_ULTIMATE.start_main_#t~pre50#1_131| |v_#pthreadsForks_287|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_52| (select (select |v_#memory_int_571| v_~get_2~0.base_103) (+ (* v_~id_0~0_193 4) v_~get_2~0.offset_103))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_36| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_50| |v_thread1Thread1of1ForFork1_minus_~b#1_76|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_52| |v_thread1Thread1of1ForFork1_minus_~a#1_76|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|) (= |v_#memory_int_570| (store |v_#memory_int_571| |v_ULTIMATE.start_main_~#t3~0#1.base_141| (store (select |v_#memory_int_571| |v_ULTIMATE.start_main_~#t3~0#1.base_141|) |v_ULTIMATE.start_main_~#t3~0#1.offset_137| |v_ULTIMATE.start_main_#t~pre50#1_131|))) (= v_~result_9~0_104 |v_thread1Thread1of1ForFork1_minus_#res#1_70|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_70| |v_thread1Thread1of1ForFork1_minus_~b#1_76|) |v_thread1Thread1of1ForFork1_minus_~a#1_76|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_50| (select (select |v_#memory_int_571| v_~get_5~0.base_118) (+ v_~get_5~0.offset_118 (* v_~id_3~0_218 4)))) (not |v_thread1Thread1of1ForFork1_#t~short5#1_105|) (<= v_~result_9~0_104 2147483647) (= (+ |v_#pthreadsForks_287| 1) |v_#pthreadsForks_286|)) InVars {~get_2~0.offset=v_~get_2~0.offset_103, #pthreadsForks=|v_#pthreadsForks_287|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_137|, ~get_5~0.base=v_~get_5~0.base_118, ~id_3~0=v_~id_3~0_218, #memory_int=|v_#memory_int_571|, ~get_2~0.base=v_~get_2~0.base_103, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_105|, ~id_0~0=v_~id_0~0_193, ~get_5~0.offset=v_~get_5~0.offset_118} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_52|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_167|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_86|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_137|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_64|, ~result_9~0=v_~result_9~0_104, #pthreadsForks=|v_#pthreadsForks_286|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_62|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_131|, ~id_3~0=v_~id_3~0_218, ~get_2~0.base=v_~get_2~0.base_103, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_74|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_36|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_68|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_36|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_56|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_70|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_111|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_50|, ~get_2~0.offset=v_~get_2~0.offset_103, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_76|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|, ~get_5~0.base=v_~get_5~0.base_118, #memory_int=|v_#memory_int_570|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_76|, ~id_0~0=v_~id_0~0_193, ~get_5~0.offset=v_~get_5~0.offset_118} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:31:55,062 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:55,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 433 [2022-12-13 01:31:55,063 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 135 transitions, 1921 flow [2022-12-13 01:31:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 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 01:31:55,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:55,063 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, 1, 1] [2022-12-13 01:31:55,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 01:31:55,063 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 01:31:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash -607818227, now seen corresponding path program 1 times [2022-12-13 01:31:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231353657] [2022-12-13 01:31:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:55,767 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 01:31:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:55,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231353657] [2022-12-13 01:31:55,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231353657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:55,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:55,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:31:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888277428] [2022-12-13 01:31:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:55,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:31:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:55,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:31:55,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:31:55,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 01:31:55,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 135 transitions, 1921 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 01:31:55,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:55,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 01:31:55,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:56,670 INFO L130 PetriNetUnfolder]: 2781/4755 cut-off events. [2022-12-13 01:31:56,670 INFO L131 PetriNetUnfolder]: For 52901/52901 co-relation queries the response was YES. [2022-12-13 01:31:56,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22823 conditions, 4755 events. 2781/4755 cut-off events. For 52901/52901 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 29553 event pairs, 1723 based on Foata normal form. 1/4601 useless extension candidates. Maximal degree in co-relation 22761. Up to 3876 conditions per place. [2022-12-13 01:31:56,693 INFO L137 encePairwiseOnDemand]: 50/63 looper letters, 131 selfloop transitions, 43 changer transitions 9/183 dead transitions. [2022-12-13 01:31:56,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 183 transitions, 2665 flow [2022-12-13 01:31:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:31:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:31:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-13 01:31:56,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2123015873015873 [2022-12-13 01:31:56,696 INFO L175 Difference]: Start difference. First operand has 107 places, 135 transitions, 1921 flow. Second operand 8 states and 107 transitions. [2022-12-13 01:31:56,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 183 transitions, 2665 flow [2022-12-13 01:31:56,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 183 transitions, 2614 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 01:31:56,835 INFO L231 Difference]: Finished difference. Result has 111 places, 136 transitions, 1998 flow [2022-12-13 01:31:56,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1998, PETRI_PLACES=111, PETRI_TRANSITIONS=136} [2022-12-13 01:31:56,836 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2022-12-13 01:31:56,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:56,836 INFO L89 Accepts]: Start accepts. Operand has 111 places, 136 transitions, 1998 flow [2022-12-13 01:31:56,837 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:56,837 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:56,837 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 136 transitions, 1998 flow [2022-12-13 01:31:56,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 136 transitions, 1998 flow [2022-12-13 01:31:56,907 INFO L130 PetriNetUnfolder]: 122/678 cut-off events. [2022-12-13 01:31:56,907 INFO L131 PetriNetUnfolder]: For 9179/9786 co-relation queries the response was YES. [2022-12-13 01:31:56,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 678 events. 122/678 cut-off events. For 9179/9786 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5795 event pairs, 5 based on Foata normal form. 15/646 useless extension candidates. Maximal degree in co-relation 3047. Up to 96 conditions per place. [2022-12-13 01:31:56,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 136 transitions, 1998 flow [2022-12-13 01:31:56,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 01:31:56,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1883] L52-->L103-3: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_59| 0) (= |v_thread2Thread1of1ForFork2_minus_~a#1_93| (+ |v_thread2Thread1of1ForFork2_minus_#res#1_83| |v_thread2Thread1of1ForFork2_minus_~b#1_93|)) (= |v_thread2Thread1of1ForFork2_minus_#res#1_83| v_~result_12~0_195) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85| (ite (or (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_93|) (<= |v_thread2Thread1of1ForFork2_minus_~a#1_93| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_93|))) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_59| 0) (<= v_~result_12~0_195 2147483647) (<= 0 (+ v_~result_12~0_195 2147483648)) (= |v_#pthreadsForks_1025| |v_ULTIMATE.start_main_#t~pre50#1_437|) (= (select (select |v_#memory_int_1430| v_~get_8~0.base_384) (+ (* v_~id_6~0_458 4) v_~get_8~0.offset_344)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_71|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_315| (select (select |v_#memory_int_1430| v_~get_2~0.base_439) (+ (* v_~id_0~0_539 4) v_~get_2~0.offset_394))) (not |v_thread1Thread1of1ForFork1_#t~short5#1_442|) (= |v_thread1Thread1of1ForFork1_#t~mem3#1_229| (select (select |v_#memory_int_1430| v_~contains_key_1~0.base_367) (+ v_~id_0~0_539 v_~contains_key_1~0.offset_314))) (= |v_thread2Thread1of1ForFork2_minus_~b#1_93| |v_thread2Thread1of1ForFork2_minus_#in~b#1_71|) (= |v_#pthreadsForks_1024| (+ |v_#pthreadsForks_1025| 1)) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_200| |v_thread2Thread1of1ForFork2_minus_#in~a#1_69|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_229| 256) 0) (= |v_thread2Thread1of1ForFork2_minus_~a#1_93| |v_thread2Thread1of1ForFork2_minus_#in~a#1_69|) (= |v_#memory_int_1429| (store |v_#memory_int_1430| |v_ULTIMATE.start_main_~#t3~0#1.base_501| (store (select |v_#memory_int_1430| |v_ULTIMATE.start_main_~#t3~0#1.base_501|) |v_ULTIMATE.start_main_~#t3~0#1.offset_443| |v_ULTIMATE.start_main_#t~pre50#1_437|)))) InVars {~id_6~0=v_~id_6~0_458, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_443|, ~get_8~0.base=v_~get_8~0.base_384, ~get_8~0.offset=v_~get_8~0.offset_344, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_501|, ~contains_key_1~0.base=v_~contains_key_1~0.base_367, ~get_2~0.offset=v_~get_2~0.offset_394, #pthreadsForks=|v_#pthreadsForks_1025|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_314, #memory_int=|v_#memory_int_1430|, ~get_2~0.base=v_~get_2~0.base_439, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_200|, ~id_0~0=v_~id_0~0_539} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_536|, ~id_6~0=v_~id_6~0_458, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_59|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_315|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_443|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_113|, ~get_8~0.base=v_~get_8~0.base_384, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_83|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_501|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_83|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_85|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_59|, ~contains_key_1~0.base=v_~contains_key_1~0.base_367, #pthreadsForks=|v_#pthreadsForks_1024|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_437|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_93|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_69|, ~get_2~0.base=v_~get_2~0.base_439, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_71|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_442|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_229|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_222|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_93|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_417|, ~get_8~0.offset=v_~get_8~0.offset_344, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_83|, ~get_2~0.offset=v_~get_2~0.offset_394, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_227|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_314, #memory_int=|v_#memory_int_1429|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_77|, ~result_12~0=v_~result_12~0_195, ~id_0~0=v_~id_0~0_539} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_minus_~b#1, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, #memory_int, thread2Thread1of1ForFork2_#t~ite18#1, ~result_12~0] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:31:57,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:31:57,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 448 [2022-12-13 01:31:57,284 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 137 transitions, 2047 flow [2022-12-13 01:31:57,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 01:31:57,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:57,285 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, 1, 1] [2022-12-13 01:31:57,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 01:31:57,285 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 01:31:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:57,285 INFO L85 PathProgramCache]: Analyzing trace with hash -90306860, now seen corresponding path program 1 times [2022-12-13 01:31:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:57,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282362859] [2022-12-13 01:31:57,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:57,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:57,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 01:31:57,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:57,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282362859] [2022-12-13 01:31:57,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282362859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:57,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:57,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:31:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297859780] [2022-12-13 01:31:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:57,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:31:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:31:57,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:31:57,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 01:31:57,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 137 transitions, 2047 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 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 01:31:57,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:57,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 01:31:57,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:58,732 INFO L130 PetriNetUnfolder]: 2778/4752 cut-off events. [2022-12-13 01:31:58,733 INFO L131 PetriNetUnfolder]: For 53584/53584 co-relation queries the response was YES. [2022-12-13 01:31:58,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22984 conditions, 4752 events. 2778/4752 cut-off events. For 53584/53584 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29699 event pairs, 1478 based on Foata normal form. 1/4598 useless extension candidates. Maximal degree in co-relation 22922. Up to 3105 conditions per place. [2022-12-13 01:31:58,760 INFO L137 encePairwiseOnDemand]: 44/64 looper letters, 127 selfloop transitions, 33 changer transitions 14/174 dead transitions. [2022-12-13 01:31:58,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 174 transitions, 2508 flow [2022-12-13 01:31:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:31:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:31:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-13 01:31:58,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.208984375 [2022-12-13 01:31:58,761 INFO L175 Difference]: Start difference. First operand has 111 places, 137 transitions, 2047 flow. Second operand 8 states and 107 transitions. [2022-12-13 01:31:58,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 174 transitions, 2508 flow [2022-12-13 01:31:58,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 174 transitions, 2407 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 01:31:58,946 INFO L231 Difference]: Finished difference. Result has 113 places, 135 transitions, 1939 flow [2022-12-13 01:31:58,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1939, PETRI_PLACES=113, PETRI_TRANSITIONS=135} [2022-12-13 01:31:58,947 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2022-12-13 01:31:58,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:31:58,947 INFO L89 Accepts]: Start accepts. Operand has 113 places, 135 transitions, 1939 flow [2022-12-13 01:31:58,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:31:58,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:31:58,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 135 transitions, 1939 flow [2022-12-13 01:31:58,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 135 transitions, 1939 flow [2022-12-13 01:31:59,009 INFO L130 PetriNetUnfolder]: 121/677 cut-off events. [2022-12-13 01:31:59,010 INFO L131 PetriNetUnfolder]: For 8856/9488 co-relation queries the response was YES. [2022-12-13 01:31:59,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 677 events. 121/677 cut-off events. For 8856/9488 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5834 event pairs, 5 based on Foata normal form. 15/645 useless extension candidates. Maximal degree in co-relation 2969. Up to 94 conditions per place. [2022-12-13 01:31:59,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 135 transitions, 1939 flow [2022-12-13 01:31:59,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 01:31:59,042 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:31:59,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 01:31:59,043 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 1939 flow [2022-12-13 01:31:59,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 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 01:31:59,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:31:59,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, 1, 1, 1] [2022-12-13 01:31:59,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 01:31:59,044 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 01:31:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:31:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -886617072, now seen corresponding path program 1 times [2022-12-13 01:31:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:31:59,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989192832] [2022-12-13 01:31:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:31:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:31:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:31:59,840 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 01:31:59,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:31:59,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989192832] [2022-12-13 01:31:59,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989192832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:31:59,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:31:59,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:31:59,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358158352] [2022-12-13 01:31:59,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:31:59,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:31:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:31:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:31:59,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 01:31:59,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 1939 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 01:31:59,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:59,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 01:31:59,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:01,496 INFO L130 PetriNetUnfolder]: 4652/8022 cut-off events. [2022-12-13 01:32:01,496 INFO L131 PetriNetUnfolder]: For 90906/90906 co-relation queries the response was YES. [2022-12-13 01:32:01,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37644 conditions, 8022 events. 4652/8022 cut-off events. For 90906/90906 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 56958 event pairs, 1420 based on Foata normal form. 1/7774 useless extension candidates. Maximal degree in co-relation 37583. Up to 4247 conditions per place. [2022-12-13 01:32:01,542 INFO L137 encePairwiseOnDemand]: 42/62 looper letters, 232 selfloop transitions, 44 changer transitions 16/292 dead transitions. [2022-12-13 01:32:01,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 292 transitions, 4633 flow [2022-12-13 01:32:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-12-13 01:32:01,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27060931899641577 [2022-12-13 01:32:01,544 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 1939 flow. Second operand 9 states and 151 transitions. [2022-12-13 01:32:01,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 292 transitions, 4633 flow [2022-12-13 01:32:01,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 292 transitions, 4485 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 01:32:01,852 INFO L231 Difference]: Finished difference. Result has 116 places, 156 transitions, 2391 flow [2022-12-13 01:32:01,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2391, PETRI_PLACES=116, PETRI_TRANSITIONS=156} [2022-12-13 01:32:01,853 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2022-12-13 01:32:01,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:01,853 INFO L89 Accepts]: Start accepts. Operand has 116 places, 156 transitions, 2391 flow [2022-12-13 01:32:01,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:01,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:01,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 156 transitions, 2391 flow [2022-12-13 01:32:01,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 156 transitions, 2391 flow [2022-12-13 01:32:01,963 INFO L130 PetriNetUnfolder]: 190/1187 cut-off events. [2022-12-13 01:32:01,963 INFO L131 PetriNetUnfolder]: For 14456/14700 co-relation queries the response was YES. [2022-12-13 01:32:01,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5272 conditions, 1187 events. 190/1187 cut-off events. For 14456/14700 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12094 event pairs, 0 based on Foata normal form. 21/1156 useless extension candidates. Maximal degree in co-relation 5221. Up to 149 conditions per place. [2022-12-13 01:32:01,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 156 transitions, 2391 flow [2022-12-13 01:32:01,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 01:32:02,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:32:02,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1887] L52-->L103-3: Formula: (and (= (store |v_#memory_int_1446| |v_ULTIMATE.start_main_~#t3~0#1.base_509| (store (select |v_#memory_int_1446| |v_ULTIMATE.start_main_~#t3~0#1.base_509|) |v_ULTIMATE.start_main_~#t3~0#1.offset_451| |v_ULTIMATE.start_main_#t~pre50#1_445|)) |v_#memory_int_1445|) (= |v_#pthreadsForks_1040| (+ |v_#pthreadsForks_1041| 1)) (not |v_thread1Thread1of1ForFork1_#t~short5#1_452|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_239| 256) 0) (= |v_#pthreadsForks_1041| |v_ULTIMATE.start_main_#t~pre50#1_445|) (= (select (select |v_#memory_int_1446| v_~contains_key_1~0.base_375) (+ v_~id_0~0_547 v_~contains_key_1~0.offset_322)) |v_thread1Thread1of1ForFork1_#t~mem3#1_239|)) InVars {#pthreadsForks=|v_#pthreadsForks_1041|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_451|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_322, #memory_int=|v_#memory_int_1446|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_509|, ~id_0~0=v_~id_0~0_547, ~contains_key_1~0.base=v_~contains_key_1~0.base_375} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_544|, #pthreadsForks=|v_#pthreadsForks_1040|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_451|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_445|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_322, #memory_int=|v_#memory_int_1445|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_425|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_509|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_452|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_239|, ~id_0~0=v_~id_0~0_547, ~contains_key_1~0.base=v_~contains_key_1~0.base_375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] [2022-12-13 01:32:02,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:32:02,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1886] L52-->L103-3: Formula: (and (= v_~result_9~0_224 |v_thread1Thread1of1ForFork1_minus_#res#1_190|) (= (mod (select (select |v_#memory_int_1442| v_~contains_key_1~0.base_373) (+ v_~id_0~0_545 v_~contains_key_1~0.offset_320)) 256) 0) (<= v_~result_9~0_224 2147483647) (not |v_thread1Thread1of1ForFork1_#t~short5#1_449|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_196| |v_thread1Thread1of1ForFork1_minus_#in~b#1_170|) (= |v_thread1Thread1of1ForFork1_#res#1.base_156| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_172| |v_thread1Thread1of1ForFork1_minus_~a#1_196|) (= |v_#pthreadsForks_1036| (+ |v_#pthreadsForks_1037| 1)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_172| (select (select |v_#memory_int_1442| v_~get_2~0.base_443) (+ (* v_~id_0~0_545 4) v_~get_2~0.offset_398))) (<= 0 (+ v_~result_9~0_224 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_156| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_170| (select (select |v_#memory_int_1442| v_~get_5~0.base_380) (+ v_~get_5~0.offset_369 (* v_~id_3~0_535 4)))) (= |v_thread1Thread1of1ForFork1_minus_~a#1_196| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_196| |v_thread1Thread1of1ForFork1_minus_#res#1_190|)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|) (= |v_#memory_int_1441| (store |v_#memory_int_1442| |v_ULTIMATE.start_main_~#t3~0#1.base_507| (store (select |v_#memory_int_1442| |v_ULTIMATE.start_main_~#t3~0#1.base_507|) |v_ULTIMATE.start_main_~#t3~0#1.offset_449| |v_ULTIMATE.start_main_#t~pre50#1_443|))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_196|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_196| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_196| 2147483647))) 1 0)) (= |v_#pthreadsForks_1037| |v_ULTIMATE.start_main_#t~pre50#1_443|)) InVars {~get_2~0.offset=v_~get_2~0.offset_398, #pthreadsForks=|v_#pthreadsForks_1037|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_449|, ~get_5~0.base=v_~get_5~0.base_380, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_320, ~id_3~0=v_~id_3~0_535, ~get_2~0.base=v_~get_2~0.base_443, #memory_int=|v_#memory_int_1442|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_507|, ~id_0~0=v_~id_0~0_545, ~get_5~0.offset=v_~get_5~0.offset_369, ~contains_key_1~0.base=v_~contains_key_1~0.base_373} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_172|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_542|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_319|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_449|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_507|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_184|, ~result_9~0=v_~result_9~0_224, ~contains_key_1~0.base=v_~contains_key_1~0.base_373, #pthreadsForks=|v_#pthreadsForks_1036|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_182|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_443|, ~id_3~0=v_~id_3~0_535, ~get_2~0.base=v_~get_2~0.base_443, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_235|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_448|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_156|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_188|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_156|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_191|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_190|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_423|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_170|, ~get_2~0.offset=v_~get_2~0.offset_398, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_196|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, ~get_5~0.base=v_~get_5~0.base_380, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_320, #memory_int=|v_#memory_int_1441|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_196|, ~id_0~0=v_~id_0~0_545, ~get_5~0.offset=v_~get_5~0.offset_369} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_449|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:32:02,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:32:02,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1189] $Ultimate##0-->L58: Formula: (= |v_thread2Thread1of1ForFork2_#t~mem10#1_1| (select (select |v_#memory_int_7| v_~get_5~0.base_3) (+ v_~get_5~0.offset_3 (* v_~id_3~0_4 4)))) InVars {~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} OutVars{~id_3~0=v_~id_3~0_4, #memory_int=|v_#memory_int_7|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_1|, ~get_5~0.offset=v_~get_5~0.offset_3, ~get_5~0.base=v_~get_5~0.base_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem10#1] and [1885] L52-->L103-3: Formula: (and (= |v_#memory_int_1437| (store |v_#memory_int_1438| |v_ULTIMATE.start_main_~#t3~0#1.base_505| (store (select |v_#memory_int_1438| |v_ULTIMATE.start_main_~#t3~0#1.base_505|) |v_ULTIMATE.start_main_~#t3~0#1.offset_447| |v_ULTIMATE.start_main_#t~pre50#1_441|))) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_233| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_446|) (= |v_#pthreadsForks_1032| (+ |v_#pthreadsForks_1033| 1)) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_317| (select (select |v_#memory_int_1438| v_~get_2~0.base_441) (+ v_~get_2~0.offset_396 (* v_~id_0~0_543 4)))) (= |v_thread1Thread1of1ForFork1_#t~mem3#1_233| (select (select |v_#memory_int_1438| v_~contains_key_1~0.base_371) (+ v_~id_0~0_543 v_~contains_key_1~0.offset_318))) (= |v_#pthreadsForks_1033| |v_ULTIMATE.start_main_#t~pre50#1_441|)) InVars {~get_2~0.offset=v_~get_2~0.offset_396, #pthreadsForks=|v_#pthreadsForks_1033|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_447|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_318, #memory_int=|v_#memory_int_1438|, ~get_2~0.base=v_~get_2~0.base_441, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_505|, ~id_0~0=v_~id_0~0_543, ~contains_key_1~0.base=v_~contains_key_1~0.base_371} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_540|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_317|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_447|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_421|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_505|, ~contains_key_1~0.base=v_~contains_key_1~0.base_371, ~get_2~0.offset=v_~get_2~0.offset_396, #pthreadsForks=|v_#pthreadsForks_1032|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_441|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_318, #memory_int=|v_#memory_int_1437|, ~get_2~0.base=v_~get_2~0.base_441, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_446|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_233|, ~id_0~0=v_~id_0~0_543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] [2022-12-13 01:32:02,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1898] $Ultimate##0-->L103-3: Formula: (let ((.cse0 (select (select |v_#memory_int_1696| v_~get_5~0.base_438) (+ (* v_~id_3~0_613 4) v_~get_5~0.offset_427)))) (and (<= v_~result_9~0_250 2147483647) (= v_~result_9~0_250 |v_thread1Thread1of1ForFork1_minus_#res#1_216|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_232| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_222| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_222| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_222|)) 1 0)) (not |v_thread1Thread1of1ForFork1_#t~short5#1_582|) (= |v_thread1Thread1of1ForFork1_#res#1.base_182| 0) (= .cse0 |v_thread2Thread1of1ForFork2_#t~mem10#1_415|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_222| |v_thread1Thread1of1ForFork1_minus_#in~b#1_196|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_198| (select (select |v_#memory_int_1696| v_~get_2~0.base_536) (+ (* v_~id_0~0_653 4) v_~get_2~0.offset_452))) (<= 0 (+ v_~result_9~0_250 2147483648)) (= (store |v_#memory_int_1696| |v_ULTIMATE.start_main_~#t3~0#1.base_654| (store (select |v_#memory_int_1696| |v_ULTIMATE.start_main_~#t3~0#1.base_654|) |v_ULTIMATE.start_main_~#t3~0#1.offset_565| |v_ULTIMATE.start_main_#t~pre50#1_559|)) |v_#memory_int_1695|) (= |v_#pthreadsForks_1280| (+ |v_#pthreadsForks_1281| 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_232| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|) (= .cse0 |v_thread1Thread1of1ForFork1_minus_#in~b#1_196|) (= (mod (select (select |v_#memory_int_1696| v_~contains_key_1~0.base_507) (+ v_~id_0~0_653 v_~contains_key_1~0.offset_420)) 256) 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_182| 0) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_222| |v_thread1Thread1of1ForFork1_minus_#res#1_216|) |v_thread1Thread1of1ForFork1_minus_~a#1_222|) (= |v_#pthreadsForks_1281| |v_ULTIMATE.start_main_#t~pre50#1_559|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_198| |v_thread1Thread1of1ForFork1_minus_~a#1_222|))) InVars {~get_2~0.offset=v_~get_2~0.offset_452, #pthreadsForks=|v_#pthreadsForks_1281|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_565|, ~get_5~0.base=v_~get_5~0.base_438, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_420, ~id_3~0=v_~id_3~0_613, ~get_2~0.base=v_~get_2~0.base_536, #memory_int=|v_#memory_int_1696|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_654|, ~id_0~0=v_~id_0~0_653, ~get_5~0.offset=v_~get_5~0.offset_427, ~contains_key_1~0.base=v_~contains_key_1~0.base_507} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_198|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_664|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_367|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_565|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_654|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_210|, ~result_9~0=v_~result_9~0_250, ~contains_key_1~0.base=v_~contains_key_1~0.base_507, #pthreadsForks=|v_#pthreadsForks_1280|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_208|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_559|, ~id_3~0=v_~id_3~0_613, ~get_2~0.base=v_~get_2~0.base_536, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_415|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_343|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_581|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_182|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_214|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_182|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_220|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_216|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_539|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_196|, ~get_2~0.offset=v_~get_2~0.offset_452, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_222|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_232|, ~get_5~0.base=v_~get_5~0.base_438, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_420, #memory_int=|v_#memory_int_1695|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_222|, ~id_0~0=v_~id_0~0_653, ~get_5~0.offset=v_~get_5~0.offset_427} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_582|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1566] L58-->L59-2: Formula: (and (= |v_thread2Thread1of1ForFork2_#t~mem10#1_28| v_~order1_13~0_25) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| v_~order2_14~0_19) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| (select (select |v_#memory_int_180| v_~get_8~0.base_41) (+ (* 4 v_~id_6~0_57) v_~get_8~0.offset_41)))) InVars {~id_6~0=v_~id_6~0_57, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_28|} OutVars{~id_6~0=v_~id_6~0_57, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_15|, ~order1_13~0=v_~order1_13~0_25, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, ~order2_14~0=v_~order2_14~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:02,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1899] $Ultimate##0-->L103-3: Formula: (and (= |v_#pthreadsForks_1284| (+ |v_#pthreadsForks_1285| 1)) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_417| (select (select |v_#memory_int_1700| v_~get_5~0.base_440) (+ (* v_~id_3~0_615 4) v_~get_5~0.offset_429))) (= |v_#pthreadsForks_1285| |v_ULTIMATE.start_main_#t~pre50#1_561|) (= |v_#memory_int_1699| (store |v_#memory_int_1700| |v_ULTIMATE.start_main_~#t3~0#1.base_656| (store (select |v_#memory_int_1700| |v_ULTIMATE.start_main_~#t3~0#1.base_656|) |v_ULTIMATE.start_main_~#t3~0#1.offset_567| |v_ULTIMATE.start_main_#t~pre50#1_561|)))) InVars {#pthreadsForks=|v_#pthreadsForks_1285|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_567|, ~get_5~0.base=v_~get_5~0.base_440, #memory_int=|v_#memory_int_1700|, ~id_3~0=v_~id_3~0_615, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_656|, ~get_5~0.offset=v_~get_5~0.offset_429} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_666|, #pthreadsForks=|v_#pthreadsForks_1284|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_567|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_561|, ~get_5~0.base=v_~get_5~0.base_440, #memory_int=|v_#memory_int_1699|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_541|, ~id_3~0=v_~id_3~0_615, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_656|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_417|, ~get_5~0.offset=v_~get_5~0.offset_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem10#1] and [1566] L58-->L59-2: Formula: (and (= |v_thread2Thread1of1ForFork2_#t~mem10#1_28| v_~order1_13~0_25) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| v_~order2_14~0_19) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| (select (select |v_#memory_int_180| v_~get_8~0.base_41) (+ (* 4 v_~id_6~0_57) v_~get_8~0.offset_41)))) InVars {~id_6~0=v_~id_6~0_57, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_28|} OutVars{~id_6~0=v_~id_6~0_57, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_15|, ~order1_13~0=v_~order1_13~0_25, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, ~order2_14~0=v_~order2_14~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:02,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1900] $Ultimate##0-->L103-3: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_585|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_345| 256) 0) (= (select (select |v_#memory_int_1704| v_~contains_key_1~0.base_509) (+ v_~id_0~0_655 v_~contains_key_1~0.offset_422)) |v_thread1Thread1of1ForFork1_#t~mem3#1_345|) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_419| (select (select |v_#memory_int_1704| v_~get_5~0.base_442) (+ v_~get_5~0.offset_431 (* v_~id_3~0_617 4)))) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_369| (select (select |v_#memory_int_1704| v_~get_2~0.base_538) (+ v_~get_2~0.offset_454 (* v_~id_0~0_655 4)))) (= |v_#memory_int_1703| (store |v_#memory_int_1704| |v_ULTIMATE.start_main_~#t3~0#1.base_658| (store (select |v_#memory_int_1704| |v_ULTIMATE.start_main_~#t3~0#1.base_658|) |v_ULTIMATE.start_main_~#t3~0#1.offset_569| |v_ULTIMATE.start_main_#t~pre50#1_563|))) (= |v_#pthreadsForks_1289| |v_ULTIMATE.start_main_#t~pre50#1_563|) (= |v_#pthreadsForks_1288| (+ |v_#pthreadsForks_1289| 1))) InVars {~get_2~0.offset=v_~get_2~0.offset_454, #pthreadsForks=|v_#pthreadsForks_1289|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_569|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_422, ~get_5~0.base=v_~get_5~0.base_442, #memory_int=|v_#memory_int_1704|, ~get_2~0.base=v_~get_2~0.base_538, ~id_3~0=v_~id_3~0_617, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_658|, ~id_0~0=v_~id_0~0_655, ~get_5~0.offset=v_~get_5~0.offset_431, ~contains_key_1~0.base=v_~contains_key_1~0.base_509} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_668|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_369|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_569|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_543|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_658|, ~contains_key_1~0.base=v_~contains_key_1~0.base_509, ~get_2~0.offset=v_~get_2~0.offset_454, #pthreadsForks=|v_#pthreadsForks_1288|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_563|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_422, ~get_5~0.base=v_~get_5~0.base_442, #memory_int=|v_#memory_int_1703|, ~get_2~0.base=v_~get_2~0.base_538, ~id_3~0=v_~id_3~0_617, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_419|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_585|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_345|, ~id_0~0=v_~id_0~0_655, ~get_5~0.offset=v_~get_5~0.offset_431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1566] L58-->L59-2: Formula: (and (= |v_thread2Thread1of1ForFork2_#t~mem10#1_28| v_~order1_13~0_25) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| v_~order2_14~0_19) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| (select (select |v_#memory_int_180| v_~get_8~0.base_41) (+ (* 4 v_~id_6~0_57) v_~get_8~0.offset_41)))) InVars {~id_6~0=v_~id_6~0_57, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_28|} OutVars{~id_6~0=v_~id_6~0_57, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_15|, ~order1_13~0=v_~order1_13~0_25, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, ~order2_14~0=v_~order2_14~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:02,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1896] $Ultimate##0-->L103-3: Formula: (and (= |v_#pthreadsForks_1272| (+ |v_#pthreadsForks_1273| 1)) (not |v_thread1Thread1of1ForFork1_#t~short5#1_579|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_341| 256) 0) (= |v_#pthreadsForks_1273| |v_ULTIMATE.start_main_#t~pre50#1_555|) (= |v_#memory_int_1687| (store |v_#memory_int_1688| |v_ULTIMATE.start_main_~#t3~0#1.base_650| (store (select |v_#memory_int_1688| |v_ULTIMATE.start_main_~#t3~0#1.base_650|) |v_ULTIMATE.start_main_~#t3~0#1.offset_561| |v_ULTIMATE.start_main_#t~pre50#1_555|))) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_411| (select (select |v_#memory_int_1688| v_~get_5~0.base_434) (+ v_~get_5~0.offset_423 (* v_~id_3~0_609 4)))) (= (select (select |v_#memory_int_1688| v_~contains_key_1~0.base_505) (+ v_~id_0~0_651 v_~contains_key_1~0.offset_418)) |v_thread1Thread1of1ForFork1_#t~mem3#1_341|)) InVars {#pthreadsForks=|v_#pthreadsForks_1273|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_561|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_418, ~get_5~0.base=v_~get_5~0.base_434, #memory_int=|v_#memory_int_1688|, ~id_3~0=v_~id_3~0_609, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_650|, ~id_0~0=v_~id_0~0_651, ~get_5~0.offset=v_~get_5~0.offset_423, ~contains_key_1~0.base=v_~contains_key_1~0.base_505} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_660|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_561|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_535|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_650|, ~contains_key_1~0.base=v_~contains_key_1~0.base_505, #pthreadsForks=|v_#pthreadsForks_1272|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_555|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_418, ~get_5~0.base=v_~get_5~0.base_434, #memory_int=|v_#memory_int_1687|, ~id_3~0=v_~id_3~0_609, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_411|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_579|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_341|, ~id_0~0=v_~id_0~0_651, ~get_5~0.offset=v_~get_5~0.offset_423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1566] L58-->L59-2: Formula: (and (= |v_thread2Thread1of1ForFork2_#t~mem10#1_28| v_~order1_13~0_25) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| v_~order2_14~0_19) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| (select (select |v_#memory_int_180| v_~get_8~0.base_41) (+ (* 4 v_~id_6~0_57) v_~get_8~0.offset_41)))) InVars {~id_6~0=v_~id_6~0_57, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_28|} OutVars{~id_6~0=v_~id_6~0_57, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_15|, ~order1_13~0=v_~order1_13~0_25, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, ~order2_14~0=v_~order2_14~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:02,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1897] $Ultimate##0-->L103-3: Formula: (and (= |v_#memory_int_1691| (store |v_#memory_int_1692| |v_ULTIMATE.start_main_~#t3~0#1.base_652| (store (select |v_#memory_int_1692| |v_ULTIMATE.start_main_~#t3~0#1.base_652|) |v_ULTIMATE.start_main_~#t3~0#1.offset_563| |v_ULTIMATE.start_main_#t~pre50#1_557|))) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_413| (select (select |v_#memory_int_1692| v_~get_5~0.base_436) (+ (* v_~id_3~0_611 4) v_~get_5~0.offset_425))) (= |v_#pthreadsForks_1277| |v_ULTIMATE.start_main_#t~pre50#1_557|) (= |v_#pthreadsForks_1276| (+ |v_#pthreadsForks_1277| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_1277|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_563|, ~get_5~0.base=v_~get_5~0.base_436, #memory_int=|v_#memory_int_1692|, ~id_3~0=v_~id_3~0_611, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_652|, ~get_5~0.offset=v_~get_5~0.offset_425} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_662|, #pthreadsForks=|v_#pthreadsForks_1276|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_563|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_557|, ~get_5~0.base=v_~get_5~0.base_436, #memory_int=|v_#memory_int_1691|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_537|, ~id_3~0=v_~id_3~0_611, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_652|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_413|, ~get_5~0.offset=v_~get_5~0.offset_425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem10#1] and [1566] L58-->L59-2: Formula: (and (= |v_thread2Thread1of1ForFork2_#t~mem10#1_28| v_~order1_13~0_25) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| v_~order2_14~0_19) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| (select (select |v_#memory_int_180| v_~get_8~0.base_41) (+ (* 4 v_~id_6~0_57) v_~get_8~0.offset_41)))) InVars {~id_6~0=v_~id_6~0_57, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_28|} OutVars{~id_6~0=v_~id_6~0_57, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_15|, ~order1_13~0=v_~order1_13~0_25, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, ~order2_14~0=v_~order2_14~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:02,811 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:32:02,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 958 [2022-12-13 01:32:02,811 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 155 transitions, 2405 flow [2022-12-13 01:32:02,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 01:32:02,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:02,812 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, 1] [2022-12-13 01:32:02,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 01:32:02,812 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 01:32:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 293459354, now seen corresponding path program 1 times [2022-12-13 01:32:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:02,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738992760] [2022-12-13 01:32:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:03,441 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 01:32:03,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:03,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738992760] [2022-12-13 01:32:03,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738992760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:03,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:03,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187649067] [2022-12-13 01:32:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:03,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:03,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:03,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:03,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:03,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 01:32:03,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 155 transitions, 2405 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:03,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:03,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 01:32:03,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:04,717 INFO L130 PetriNetUnfolder]: 4337/7492 cut-off events. [2022-12-13 01:32:04,717 INFO L131 PetriNetUnfolder]: For 87270/87270 co-relation queries the response was YES. [2022-12-13 01:32:04,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36639 conditions, 7492 events. 4337/7492 cut-off events. For 87270/87270 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 52460 event pairs, 2566 based on Foata normal form. 1/7257 useless extension candidates. Maximal degree in co-relation 36576. Up to 6143 conditions per place. [2022-12-13 01:32:04,756 INFO L137 encePairwiseOnDemand]: 57/68 looper letters, 146 selfloop transitions, 41 changer transitions 8/195 dead transitions. [2022-12-13 01:32:04,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 195 transitions, 3113 flow [2022-12-13 01:32:04,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:32:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:32:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-13 01:32:04,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22058823529411764 [2022-12-13 01:32:04,757 INFO L175 Difference]: Start difference. First operand has 113 places, 155 transitions, 2405 flow. Second operand 7 states and 105 transitions. [2022-12-13 01:32:04,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 195 transitions, 3113 flow [2022-12-13 01:32:05,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 195 transitions, 3082 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:05,052 INFO L231 Difference]: Finished difference. Result has 117 places, 156 transitions, 2473 flow [2022-12-13 01:32:05,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2376, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2473, PETRI_PLACES=117, PETRI_TRANSITIONS=156} [2022-12-13 01:32:05,053 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2022-12-13 01:32:05,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:05,053 INFO L89 Accepts]: Start accepts. Operand has 117 places, 156 transitions, 2473 flow [2022-12-13 01:32:05,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:05,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:05,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 156 transitions, 2473 flow [2022-12-13 01:32:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 156 transitions, 2473 flow [2022-12-13 01:32:05,159 INFO L130 PetriNetUnfolder]: 191/1153 cut-off events. [2022-12-13 01:32:05,159 INFO L131 PetriNetUnfolder]: For 15993/16193 co-relation queries the response was YES. [2022-12-13 01:32:05,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 1153 events. 191/1153 cut-off events. For 15993/16193 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11610 event pairs, 0 based on Foata normal form. 50/1141 useless extension candidates. Maximal degree in co-relation 5333. Up to 145 conditions per place. [2022-12-13 01:32:05,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 156 transitions, 2473 flow [2022-12-13 01:32:05,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 1276 [2022-12-13 01:32:05,199 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:05,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 01:32:05,202 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 156 transitions, 2473 flow [2022-12-13 01:32:05,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:05,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:05,203 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 01:32:05,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 01:32:05,203 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 01:32:05,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1311104772, now seen corresponding path program 1 times [2022-12-13 01:32:05,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:05,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682303832] [2022-12-13 01:32:05,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:05,826 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 01:32:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:05,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682303832] [2022-12-13 01:32:05,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682303832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:05,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:05,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:32:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906436046] [2022-12-13 01:32:05,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:05,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:32:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:05,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:32:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:32:05,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 01:32:05,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 156 transitions, 2473 flow. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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 01:32:05,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:05,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 01:32:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:07,018 INFO L130 PetriNetUnfolder]: 4379/7585 cut-off events. [2022-12-13 01:32:07,019 INFO L131 PetriNetUnfolder]: For 98959/98959 co-relation queries the response was YES. [2022-12-13 01:32:07,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38490 conditions, 7585 events. 4379/7585 cut-off events. For 98959/98959 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 53207 event pairs, 3058 based on Foata normal form. 1/7349 useless extension candidates. Maximal degree in co-relation 38427. Up to 7473 conditions per place. [2022-12-13 01:32:07,065 INFO L137 encePairwiseOnDemand]: 62/68 looper letters, 167 selfloop transitions, 4 changer transitions 10/181 dead transitions. [2022-12-13 01:32:07,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 181 transitions, 2934 flow [2022-12-13 01:32:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:32:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:32:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-13 01:32:07,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1953781512605042 [2022-12-13 01:32:07,067 INFO L175 Difference]: Start difference. First operand has 116 places, 156 transitions, 2473 flow. Second operand 7 states and 93 transitions. [2022-12-13 01:32:07,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 181 transitions, 2934 flow [2022-12-13 01:32:07,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 181 transitions, 2849 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 01:32:07,426 INFO L231 Difference]: Finished difference. Result has 121 places, 157 transitions, 2417 flow [2022-12-13 01:32:07,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2417, PETRI_PLACES=121, PETRI_TRANSITIONS=157} [2022-12-13 01:32:07,427 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2022-12-13 01:32:07,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:07,427 INFO L89 Accepts]: Start accepts. Operand has 121 places, 157 transitions, 2417 flow [2022-12-13 01:32:07,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:07,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:07,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 157 transitions, 2417 flow [2022-12-13 01:32:07,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 157 transitions, 2417 flow [2022-12-13 01:32:07,532 INFO L130 PetriNetUnfolder]: 185/1121 cut-off events. [2022-12-13 01:32:07,532 INFO L131 PetriNetUnfolder]: For 14820/15033 co-relation queries the response was YES. [2022-12-13 01:32:07,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5073 conditions, 1121 events. 185/1121 cut-off events. For 14820/15033 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11237 event pairs, 0 based on Foata normal form. 63/1137 useless extension candidates. Maximal degree in co-relation 5019. Up to 140 conditions per place. [2022-12-13 01:32:07,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 157 transitions, 2417 flow [2022-12-13 01:32:07,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 1282 [2022-12-13 01:32:07,544 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:07,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:32:07,545 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 157 transitions, 2417 flow [2022-12-13 01:32:07,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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 01:32:07,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:07,545 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 01:32:07,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 01:32:07,545 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 01:32:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1628901948, now seen corresponding path program 2 times [2022-12-13 01:32:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:07,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594519538] [2022-12-13 01:32:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:07,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:08,077 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 01:32:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:08,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594519538] [2022-12-13 01:32:08,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594519538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:08,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:08,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:32:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121567900] [2022-12-13 01:32:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:08,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:32:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:32:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:32:08,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 01:32:08,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 157 transitions, 2417 flow. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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 01:32:08,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:08,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 01:32:08,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:09,335 INFO L130 PetriNetUnfolder]: 4370/7561 cut-off events. [2022-12-13 01:32:09,336 INFO L131 PetriNetUnfolder]: For 92244/92244 co-relation queries the response was YES. [2022-12-13 01:32:09,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37552 conditions, 7561 events. 4370/7561 cut-off events. For 92244/92244 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 52964 event pairs, 3034 based on Foata normal form. 1/7326 useless extension candidates. Maximal degree in co-relation 37486. Up to 7473 conditions per place. [2022-12-13 01:32:09,374 INFO L137 encePairwiseOnDemand]: 62/68 looper letters, 153 selfloop transitions, 2 changer transitions 22/177 dead transitions. [2022-12-13 01:32:09,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 177 transitions, 2835 flow [2022-12-13 01:32:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:32:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:32:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2022-12-13 01:32:09,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18907563025210083 [2022-12-13 01:32:09,375 INFO L175 Difference]: Start difference. First operand has 120 places, 157 transitions, 2417 flow. Second operand 7 states and 90 transitions. [2022-12-13 01:32:09,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 177 transitions, 2835 flow [2022-12-13 01:32:09,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 177 transitions, 2822 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 01:32:09,673 INFO L231 Difference]: Finished difference. Result has 124 places, 155 transitions, 2368 flow [2022-12-13 01:32:09,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2368, PETRI_PLACES=124, PETRI_TRANSITIONS=155} [2022-12-13 01:32:09,673 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2022-12-13 01:32:09,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:09,673 INFO L89 Accepts]: Start accepts. Operand has 124 places, 155 transitions, 2368 flow [2022-12-13 01:32:09,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:09,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:09,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 155 transitions, 2368 flow [2022-12-13 01:32:09,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 155 transitions, 2368 flow [2022-12-13 01:32:09,780 INFO L130 PetriNetUnfolder]: 185/1107 cut-off events. [2022-12-13 01:32:09,780 INFO L131 PetriNetUnfolder]: For 14626/14836 co-relation queries the response was YES. [2022-12-13 01:32:09,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 1107 events. 185/1107 cut-off events. For 14626/14836 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11035 event pairs, 0 based on Foata normal form. 62/1122 useless extension candidates. Maximal degree in co-relation 4979. Up to 139 conditions per place. [2022-12-13 01:32:09,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 155 transitions, 2368 flow [2022-12-13 01:32:09,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 1276 [2022-12-13 01:32:09,793 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:09,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:32:09,794 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 155 transitions, 2368 flow [2022-12-13 01:32:09,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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 01:32:09,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:09,794 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, 1] [2022-12-13 01:32:09,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 01:32:09,794 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 01:32:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash 861163050, now seen corresponding path program 2 times [2022-12-13 01:32:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:09,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444167049] [2022-12-13 01:32:09,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:10,466 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 01:32:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444167049] [2022-12-13 01:32:10,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444167049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:10,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:10,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358770452] [2022-12-13 01:32:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:10,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:10,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-13 01:32:10,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 155 transitions, 2368 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:10,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:10,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-13 01:32:10,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:11,788 INFO L130 PetriNetUnfolder]: 4331/7478 cut-off events. [2022-12-13 01:32:11,788 INFO L131 PetriNetUnfolder]: For 90663/90663 co-relation queries the response was YES. [2022-12-13 01:32:11,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37224 conditions, 7478 events. 4331/7478 cut-off events. For 90663/90663 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 52205 event pairs, 2626 based on Foata normal form. 1/7243 useless extension candidates. Maximal degree in co-relation 37167. Up to 6145 conditions per place. [2022-12-13 01:32:11,830 INFO L137 encePairwiseOnDemand]: 55/67 looper letters, 134 selfloop transitions, 40 changer transitions 13/187 dead transitions. [2022-12-13 01:32:11,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 187 transitions, 3031 flow [2022-12-13 01:32:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:11,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-13 01:32:11,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18097014925373134 [2022-12-13 01:32:11,831 INFO L175 Difference]: Start difference. First operand has 118 places, 155 transitions, 2368 flow. Second operand 8 states and 97 transitions. [2022-12-13 01:32:11,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 187 transitions, 3031 flow [2022-12-13 01:32:12,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 187 transitions, 3020 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:12,173 INFO L231 Difference]: Finished difference. Result has 122 places, 153 transitions, 2398 flow [2022-12-13 01:32:12,173 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2398, PETRI_PLACES=122, PETRI_TRANSITIONS=153} [2022-12-13 01:32:12,173 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2022-12-13 01:32:12,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:12,173 INFO L89 Accepts]: Start accepts. Operand has 122 places, 153 transitions, 2398 flow [2022-12-13 01:32:12,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:12,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:12,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 153 transitions, 2398 flow [2022-12-13 01:32:12,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 153 transitions, 2398 flow [2022-12-13 01:32:12,276 INFO L130 PetriNetUnfolder]: 185/1091 cut-off events. [2022-12-13 01:32:12,276 INFO L131 PetriNetUnfolder]: For 16068/16278 co-relation queries the response was YES. [2022-12-13 01:32:12,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5173 conditions, 1091 events. 185/1091 cut-off events. For 16068/16278 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10794 event pairs, 0 based on Foata normal form. 62/1106 useless extension candidates. Maximal degree in co-relation 5124. Up to 138 conditions per place. [2022-12-13 01:32:12,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 153 transitions, 2398 flow [2022-12-13 01:32:12,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-13 01:32:12,296 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:12,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:32:12,297 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 153 transitions, 2398 flow [2022-12-13 01:32:12,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:12,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:12,297 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, 1] [2022-12-13 01:32:12,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 01:32:12,298 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 01:32:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 521919808, now seen corresponding path program 1 times [2022-12-13 01:32:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:12,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116024409] [2022-12-13 01:32:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:12,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:12,818 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 01:32:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116024409] [2022-12-13 01:32:12,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116024409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:12,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283990029] [2022-12-13 01:32:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:12,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:12,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:12,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 01:32:12,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 153 transitions, 2398 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:12,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:12,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 01:32:12,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:14,114 INFO L130 PetriNetUnfolder]: 4442/7883 cut-off events. [2022-12-13 01:32:14,114 INFO L131 PetriNetUnfolder]: For 105198/105198 co-relation queries the response was YES. [2022-12-13 01:32:14,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40229 conditions, 7883 events. 4442/7883 cut-off events. For 105198/105198 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 57320 event pairs, 2266 based on Foata normal form. 4/7635 useless extension candidates. Maximal degree in co-relation 40172. Up to 4828 conditions per place. [2022-12-13 01:32:14,164 INFO L137 encePairwiseOnDemand]: 55/66 looper letters, 166 selfloop transitions, 45 changer transitions 13/224 dead transitions. [2022-12-13 01:32:14,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 224 transitions, 3493 flow [2022-12-13 01:32:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:32:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:32:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-13 01:32:14,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-13 01:32:14,165 INFO L175 Difference]: Start difference. First operand has 116 places, 153 transitions, 2398 flow. Second operand 7 states and 126 transitions. [2022-12-13 01:32:14,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 224 transitions, 3493 flow [2022-12-13 01:32:14,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 224 transitions, 3387 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-13 01:32:14,551 INFO L231 Difference]: Finished difference. Result has 117 places, 155 transitions, 2466 flow [2022-12-13 01:32:14,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2310, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2466, PETRI_PLACES=117, PETRI_TRANSITIONS=155} [2022-12-13 01:32:14,551 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2022-12-13 01:32:14,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:14,551 INFO L89 Accepts]: Start accepts. Operand has 117 places, 155 transitions, 2466 flow [2022-12-13 01:32:14,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:14,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:14,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 155 transitions, 2466 flow [2022-12-13 01:32:14,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 155 transitions, 2466 flow [2022-12-13 01:32:14,662 INFO L130 PetriNetUnfolder]: 180/1221 cut-off events. [2022-12-13 01:32:14,662 INFO L131 PetriNetUnfolder]: For 17358/17568 co-relation queries the response was YES. [2022-12-13 01:32:14,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5466 conditions, 1221 events. 180/1221 cut-off events. For 17358/17568 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12703 event pairs, 0 based on Foata normal form. 62/1231 useless extension candidates. Maximal degree in co-relation 5419. Up to 147 conditions per place. [2022-12-13 01:32:14,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 155 transitions, 2466 flow [2022-12-13 01:32:14,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 1316 [2022-12-13 01:32:14,675 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:14,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:32:14,676 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 155 transitions, 2466 flow [2022-12-13 01:32:14,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:14,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:14,676 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, 1] [2022-12-13 01:32:14,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 01:32:14,676 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 01:32:14,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1698231795, now seen corresponding path program 1 times [2022-12-13 01:32:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:14,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192888101] [2022-12-13 01:32:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:15,301 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 01:32:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:15,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192888101] [2022-12-13 01:32:15,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192888101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:15,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:15,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312640891] [2022-12-13 01:32:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:15,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:15,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:15,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:15,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-13 01:32:15,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 155 transitions, 2466 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:15,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:15,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-13 01:32:15,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:16,560 INFO L130 PetriNetUnfolder]: 4435/7848 cut-off events. [2022-12-13 01:32:16,560 INFO L131 PetriNetUnfolder]: For 107023/107023 co-relation queries the response was YES. [2022-12-13 01:32:16,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39519 conditions, 7848 events. 4435/7848 cut-off events. For 107023/107023 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 56699 event pairs, 3128 based on Foata normal form. 1/7596 useless extension candidates. Maximal degree in co-relation 39464. Up to 7613 conditions per place. [2022-12-13 01:32:16,617 INFO L137 encePairwiseOnDemand]: 58/65 looper letters, 177 selfloop transitions, 6 changer transitions 11/194 dead transitions. [2022-12-13 01:32:16,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 3010 flow [2022-12-13 01:32:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 01:32:16,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-13 01:32:16,618 INFO L175 Difference]: Start difference. First operand has 114 places, 155 transitions, 2466 flow. Second operand 8 states and 104 transitions. [2022-12-13 01:32:16,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 3010 flow [2022-12-13 01:32:17,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 194 transitions, 2927 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:17,074 INFO L231 Difference]: Finished difference. Result has 120 places, 157 transitions, 2429 flow [2022-12-13 01:32:17,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=2387, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2429, PETRI_PLACES=120, PETRI_TRANSITIONS=157} [2022-12-13 01:32:17,074 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2022-12-13 01:32:17,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:17,075 INFO L89 Accepts]: Start accepts. Operand has 120 places, 157 transitions, 2429 flow [2022-12-13 01:32:17,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:17,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:17,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 157 transitions, 2429 flow [2022-12-13 01:32:17,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 157 transitions, 2429 flow [2022-12-13 01:32:17,189 INFO L130 PetriNetUnfolder]: 178/1204 cut-off events. [2022-12-13 01:32:17,190 INFO L131 PetriNetUnfolder]: For 15125/15337 co-relation queries the response was YES. [2022-12-13 01:32:17,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5274 conditions, 1204 events. 178/1204 cut-off events. For 15125/15337 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12504 event pairs, 0 based on Foata normal form. 63/1214 useless extension candidates. Maximal degree in co-relation 5224. Up to 146 conditions per place. [2022-12-13 01:32:17,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 157 transitions, 2429 flow [2022-12-13 01:32:17,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 1330 [2022-12-13 01:32:17,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1886] L52-->L103-3: Formula: (and (= v_~result_9~0_224 |v_thread1Thread1of1ForFork1_minus_#res#1_190|) (= (mod (select (select |v_#memory_int_1442| v_~contains_key_1~0.base_373) (+ v_~id_0~0_545 v_~contains_key_1~0.offset_320)) 256) 0) (<= v_~result_9~0_224 2147483647) (not |v_thread1Thread1of1ForFork1_#t~short5#1_449|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_196| |v_thread1Thread1of1ForFork1_minus_#in~b#1_170|) (= |v_thread1Thread1of1ForFork1_#res#1.base_156| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_172| |v_thread1Thread1of1ForFork1_minus_~a#1_196|) (= |v_#pthreadsForks_1036| (+ |v_#pthreadsForks_1037| 1)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_172| (select (select |v_#memory_int_1442| v_~get_2~0.base_443) (+ (* v_~id_0~0_545 4) v_~get_2~0.offset_398))) (<= 0 (+ v_~result_9~0_224 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_156| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_170| (select (select |v_#memory_int_1442| v_~get_5~0.base_380) (+ v_~get_5~0.offset_369 (* v_~id_3~0_535 4)))) (= |v_thread1Thread1of1ForFork1_minus_~a#1_196| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_196| |v_thread1Thread1of1ForFork1_minus_#res#1_190|)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|) (= |v_#memory_int_1441| (store |v_#memory_int_1442| |v_ULTIMATE.start_main_~#t3~0#1.base_507| (store (select |v_#memory_int_1442| |v_ULTIMATE.start_main_~#t3~0#1.base_507|) |v_ULTIMATE.start_main_~#t3~0#1.offset_449| |v_ULTIMATE.start_main_#t~pre50#1_443|))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_196|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_196| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_196| 2147483647))) 1 0)) (= |v_#pthreadsForks_1037| |v_ULTIMATE.start_main_#t~pre50#1_443|)) InVars {~get_2~0.offset=v_~get_2~0.offset_398, #pthreadsForks=|v_#pthreadsForks_1037|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_449|, ~get_5~0.base=v_~get_5~0.base_380, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_320, ~id_3~0=v_~id_3~0_535, ~get_2~0.base=v_~get_2~0.base_443, #memory_int=|v_#memory_int_1442|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_507|, ~id_0~0=v_~id_0~0_545, ~get_5~0.offset=v_~get_5~0.offset_369, ~contains_key_1~0.base=v_~contains_key_1~0.base_373} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_172|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_542|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_319|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_449|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_507|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_184|, ~result_9~0=v_~result_9~0_224, ~contains_key_1~0.base=v_~contains_key_1~0.base_373, #pthreadsForks=|v_#pthreadsForks_1036|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_182|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_443|, ~id_3~0=v_~id_3~0_535, ~get_2~0.base=v_~get_2~0.base_443, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_235|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_448|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_156|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_188|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_156|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_191|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_190|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_423|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_170|, ~get_2~0.offset=v_~get_2~0.offset_398, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_196|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, ~get_5~0.base=v_~get_5~0.base_380, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_320, #memory_int=|v_#memory_int_1441|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_196|, ~id_0~0=v_~id_0~0_545, ~get_5~0.offset=v_~get_5~0.offset_369} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_449|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:17,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:32:17,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-13 01:32:17,361 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 157 transitions, 2434 flow [2022-12-13 01:32:17,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:17,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:17,361 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, 1] [2022-12-13 01:32:17,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 01:32:17,362 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 01:32:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1875598037, now seen corresponding path program 2 times [2022-12-13 01:32:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:17,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276748608] [2022-12-13 01:32:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:18,062 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 01:32:18,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:18,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276748608] [2022-12-13 01:32:18,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276748608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:18,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:18,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129389812] [2022-12-13 01:32:18,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:18,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:18,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 01:32:18,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 157 transitions, 2434 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:18,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:18,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 01:32:18,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:19,348 INFO L130 PetriNetUnfolder]: 4414/7811 cut-off events. [2022-12-13 01:32:19,349 INFO L131 PetriNetUnfolder]: For 92095/92095 co-relation queries the response was YES. [2022-12-13 01:32:19,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38396 conditions, 7811 events. 4414/7811 cut-off events. For 92095/92095 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 56823 event pairs, 1913 based on Foata normal form. 1/7560 useless extension candidates. Maximal degree in co-relation 38338. Up to 4391 conditions per place. [2022-12-13 01:32:19,391 INFO L137 encePairwiseOnDemand]: 49/66 looper letters, 210 selfloop transitions, 32 changer transitions 12/254 dead transitions. [2022-12-13 01:32:19,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 254 transitions, 4144 flow [2022-12-13 01:32:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-13 01:32:19,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23106060606060605 [2022-12-13 01:32:19,393 INFO L175 Difference]: Start difference. First operand has 119 places, 157 transitions, 2434 flow. Second operand 8 states and 122 transitions. [2022-12-13 01:32:19,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 254 transitions, 4144 flow [2022-12-13 01:32:19,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 254 transitions, 4121 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:19,750 INFO L231 Difference]: Finished difference. Result has 124 places, 157 transitions, 2493 flow [2022-12-13 01:32:19,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2493, PETRI_PLACES=124, PETRI_TRANSITIONS=157} [2022-12-13 01:32:19,750 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2022-12-13 01:32:19,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:19,750 INFO L89 Accepts]: Start accepts. Operand has 124 places, 157 transitions, 2493 flow [2022-12-13 01:32:19,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:19,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:19,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 157 transitions, 2493 flow [2022-12-13 01:32:19,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 157 transitions, 2493 flow [2022-12-13 01:32:19,859 INFO L130 PetriNetUnfolder]: 178/1216 cut-off events. [2022-12-13 01:32:19,859 INFO L131 PetriNetUnfolder]: For 15354/15562 co-relation queries the response was YES. [2022-12-13 01:32:19,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 1216 events. 178/1216 cut-off events. For 15354/15562 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12657 event pairs, 0 based on Foata normal form. 61/1226 useless extension candidates. Maximal degree in co-relation 5311. Up to 145 conditions per place. [2022-12-13 01:32:19,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 157 transitions, 2493 flow [2022-12-13 01:32:19,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 1322 [2022-12-13 01:32:19,888 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:19,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:32:19,889 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 157 transitions, 2493 flow [2022-12-13 01:32:19,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:19,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:19,889 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 01:32:19,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 01:32:19,889 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 01:32:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash -879921991, now seen corresponding path program 1 times [2022-12-13 01:32:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:19,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763822375] [2022-12-13 01:32:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:19,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:20,480 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 01:32:20,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:20,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763822375] [2022-12-13 01:32:20,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763822375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:20,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:20,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:20,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310481280] [2022-12-13 01:32:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:20,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:20,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:20,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 01:32:20,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 157 transitions, 2493 flow. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:32:20,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:20,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 01:32:20,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:21,668 INFO L130 PetriNetUnfolder]: 4405/7787 cut-off events. [2022-12-13 01:32:21,668 INFO L131 PetriNetUnfolder]: For 95568/95568 co-relation queries the response was YES. [2022-12-13 01:32:21,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38559 conditions, 7787 events. 4405/7787 cut-off events. For 95568/95568 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 56183 event pairs, 3062 based on Foata normal form. 1/7536 useless extension candidates. Maximal degree in co-relation 38500. Up to 7699 conditions per place. [2022-12-13 01:32:21,705 INFO L137 encePairwiseOnDemand]: 60/66 looper letters, 153 selfloop transitions, 2 changer transitions 22/177 dead transitions. [2022-12-13 01:32:21,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 177 transitions, 2913 flow [2022-12-13 01:32:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:32:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:32:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-13 01:32:21,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19047619047619047 [2022-12-13 01:32:21,707 INFO L175 Difference]: Start difference. First operand has 123 places, 157 transitions, 2493 flow. Second operand 7 states and 88 transitions. [2022-12-13 01:32:21,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 177 transitions, 2913 flow [2022-12-13 01:32:22,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 177 transitions, 2843 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 01:32:22,014 INFO L231 Difference]: Finished difference. Result has 125 places, 155 transitions, 2384 flow [2022-12-13 01:32:22,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2384, PETRI_PLACES=125, PETRI_TRANSITIONS=155} [2022-12-13 01:32:22,014 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2022-12-13 01:32:22,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:22,014 INFO L89 Accepts]: Start accepts. Operand has 125 places, 155 transitions, 2384 flow [2022-12-13 01:32:22,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:22,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:22,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 155 transitions, 2384 flow [2022-12-13 01:32:22,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 155 transitions, 2384 flow [2022-12-13 01:32:22,131 INFO L130 PetriNetUnfolder]: 183/1244 cut-off events. [2022-12-13 01:32:22,132 INFO L131 PetriNetUnfolder]: For 14894/15090 co-relation queries the response was YES. [2022-12-13 01:32:22,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5425 conditions, 1244 events. 183/1244 cut-off events. For 14894/15090 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13072 event pairs, 0 based on Foata normal form. 48/1227 useless extension candidates. Maximal degree in co-relation 5378. Up to 148 conditions per place. [2022-12-13 01:32:22,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 155 transitions, 2384 flow [2022-12-13 01:32:22,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 1316 [2022-12-13 01:32:22,144 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:22,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:32:22,144 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 2384 flow [2022-12-13 01:32:22,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:32:22,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:22,145 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, 1] [2022-12-13 01:32:22,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 01:32:22,145 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 01:32:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1369638157, now seen corresponding path program 3 times [2022-12-13 01:32:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:22,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608764837] [2022-12-13 01:32:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:22,680 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 01:32:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:22,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608764837] [2022-12-13 01:32:22,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608764837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:22,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:22,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382384077] [2022-12-13 01:32:22,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:22,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:22,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:22,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:22,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-13 01:32:22,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 2384 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:22,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:22,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-13 01:32:22,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:23,900 INFO L130 PetriNetUnfolder]: 4366/7704 cut-off events. [2022-12-13 01:32:23,900 INFO L131 PetriNetUnfolder]: For 89748/89748 co-relation queries the response was YES. [2022-12-13 01:32:23,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37899 conditions, 7704 events. 4366/7704 cut-off events. For 89748/89748 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 56091 event pairs, 1700 based on Foata normal form. 1/7453 useless extension candidates. Maximal degree in co-relation 37840. Up to 4391 conditions per place. [2022-12-13 01:32:23,948 INFO L137 encePairwiseOnDemand]: 49/65 looper letters, 194 selfloop transitions, 29 changer transitions 24/247 dead transitions. [2022-12-13 01:32:23,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 247 transitions, 4030 flow [2022-12-13 01:32:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-13 01:32:23,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22692307692307692 [2022-12-13 01:32:23,949 INFO L175 Difference]: Start difference. First operand has 120 places, 155 transitions, 2384 flow. Second operand 8 states and 118 transitions. [2022-12-13 01:32:23,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 247 transitions, 4030 flow [2022-12-13 01:32:24,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 247 transitions, 4016 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 01:32:24,347 INFO L231 Difference]: Finished difference. Result has 122 places, 152 transitions, 2371 flow [2022-12-13 01:32:24,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2371, PETRI_PLACES=122, PETRI_TRANSITIONS=152} [2022-12-13 01:32:24,347 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2022-12-13 01:32:24,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:24,347 INFO L89 Accepts]: Start accepts. Operand has 122 places, 152 transitions, 2371 flow [2022-12-13 01:32:24,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:24,349 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:24,349 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 152 transitions, 2371 flow [2022-12-13 01:32:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 152 transitions, 2371 flow [2022-12-13 01:32:24,454 INFO L130 PetriNetUnfolder]: 178/1191 cut-off events. [2022-12-13 01:32:24,454 INFO L131 PetriNetUnfolder]: For 14776/14973 co-relation queries the response was YES. [2022-12-13 01:32:24,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5245 conditions, 1191 events. 178/1191 cut-off events. For 14776/14973 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12307 event pairs, 0 based on Foata normal form. 56/1196 useless extension candidates. Maximal degree in co-relation 5196. Up to 143 conditions per place. [2022-12-13 01:32:24,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 152 transitions, 2371 flow [2022-12-13 01:32:24,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 1292 [2022-12-13 01:32:24,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1871] L52-->L103-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre50#1_372| |v_#pthreadsForks_835|) (= (store |v_#memory_int_1197| |v_ULTIMATE.start_main_~#t3~0#1.base_432| (store (select |v_#memory_int_1197| |v_ULTIMATE.start_main_~#t3~0#1.base_432|) |v_ULTIMATE.start_main_~#t3~0#1.offset_378| |v_ULTIMATE.start_main_#t~pre50#1_372|)) |v_#memory_int_1196|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_347|) (= (select (select |v_#memory_int_1197| v_~contains_key_1~0.base_285) (+ v_~id_0~0_441 v_~contains_key_1~0.offset_236)) |v_thread1Thread1of1ForFork1_#t~mem3#1_172|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_172| 256) 0) (= (+ |v_#pthreadsForks_835| 1) |v_#pthreadsForks_834|)) InVars {#pthreadsForks=|v_#pthreadsForks_835|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_378|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_236, #memory_int=|v_#memory_int_1197|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_432|, ~id_0~0=v_~id_0~0_441, ~contains_key_1~0.base=v_~contains_key_1~0.base_285} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_441|, #pthreadsForks=|v_#pthreadsForks_834|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_378|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_372|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_236, #memory_int=|v_#memory_int_1196|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_352|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_432|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_347|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_172|, ~id_0~0=v_~id_0~0_441, ~contains_key_1~0.base=v_~contains_key_1~0.base_285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1875] L52-->L103-3: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~mem3#1_182| (select (select |v_#memory_int_1209| v_~contains_key_1~0.base_293) (+ v_~id_0~0_449 v_~contains_key_1~0.offset_244))) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_244| (select (select |v_#memory_int_1209| v_~get_2~0.base_359) (+ (* v_~id_0~0_449 4) v_~get_2~0.offset_318))) (= (+ |v_#pthreadsForks_843| 1) |v_#pthreadsForks_842|) (= |v_ULTIMATE.start_main_#t~pre50#1_376| |v_#pthreadsForks_843|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_357|) (= (store |v_#memory_int_1209| |v_ULTIMATE.start_main_~#t3~0#1.base_436| (store (select |v_#memory_int_1209| |v_ULTIMATE.start_main_~#t3~0#1.base_436|) |v_ULTIMATE.start_main_~#t3~0#1.offset_382| |v_ULTIMATE.start_main_#t~pre50#1_376|)) |v_#memory_int_1208|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_182| 256) 0)) InVars {~get_2~0.offset=v_~get_2~0.offset_318, #pthreadsForks=|v_#pthreadsForks_843|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_382|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_244, #memory_int=|v_#memory_int_1209|, ~get_2~0.base=v_~get_2~0.base_359, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_436|, ~id_0~0=v_~id_0~0_449, ~contains_key_1~0.base=v_~contains_key_1~0.base_293} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_445|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_244|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_382|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_356|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_436|, ~contains_key_1~0.base=v_~contains_key_1~0.base_293, ~get_2~0.offset=v_~get_2~0.offset_318, #pthreadsForks=|v_#pthreadsForks_842|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_376|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_244, #memory_int=|v_#memory_int_1208|, ~get_2~0.base=v_~get_2~0.base_359, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_357|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_182|, ~id_0~0=v_~id_0~0_449} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1857] L52-6-->L103-3: Formula: (and (= (select (select |v_#memory_int_579| v_~get_2~0.base_107) (+ (* v_~id_0~0_197 4) v_~get_2~0.offset_107)) |v_thread1Thread1of1ForFork1_#t~mem6#1_94|) (= |v_#memory_int_578| (store |v_#memory_int_579| |v_ULTIMATE.start_main_~#t3~0#1.base_143| (store (select |v_#memory_int_579| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) |v_ULTIMATE.start_main_~#t3~0#1.offset_139| |v_ULTIMATE.start_main_#t~pre50#1_133|))) (= |v_ULTIMATE.start_main_#t~pre50#1_133| |v_#pthreadsForks_295|) (= (+ |v_#pthreadsForks_295| 1) |v_#pthreadsForks_294|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_112|)) InVars {~get_2~0.offset=v_~get_2~0.offset_107, #pthreadsForks=|v_#pthreadsForks_295|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_139|, #memory_int=|v_#memory_int_579|, ~get_2~0.base=v_~get_2~0.base_107, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_112|, ~id_0~0=v_~id_0~0_197} OutVars{~get_2~0.offset=v_~get_2~0.offset_107, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_171|, #pthreadsForks=|v_#pthreadsForks_294|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_94|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_139|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_133|, #memory_int=|v_#memory_int_578|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_113|, ~get_2~0.base=v_~get_2~0.base_107, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_112|, ~id_0~0=v_~id_0~0_197} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1861] L52-->L103-3: Formula: (and (= (store |v_#memory_int_753| |v_ULTIMATE.start_main_~#t3~0#1.base_214| (store (select |v_#memory_int_753| |v_ULTIMATE.start_main_~#t3~0#1.base_214|) |v_ULTIMATE.start_main_~#t3~0#1.offset_197| |v_ULTIMATE.start_main_#t~pre50#1_191|)) |v_#memory_int_752|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_122| 256) 0) (= |v_thread1Thread1of1ForFork1_#t~mem3#1_122| (select (select |v_#memory_int_753| v_~contains_key_1~0.base_151) (+ v_~id_0~0_274 v_~contains_key_1~0.offset_148))) (not |v_thread1Thread1of1ForFork1_#t~short5#1_194|) (= |v_ULTIMATE.start_main_#t~pre50#1_191| |v_#pthreadsForks_449|) (= (+ |v_#pthreadsForks_449| 1) |v_#pthreadsForks_448|) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_134| (select (select |v_#memory_int_753| v_~get_2~0.base_165) (+ v_~get_2~0.offset_163 (* v_~id_0~0_274 4))))) InVars {~get_2~0.offset=v_~get_2~0.offset_163, #pthreadsForks=|v_#pthreadsForks_449|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_197|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_148, #memory_int=|v_#memory_int_753|, ~get_2~0.base=v_~get_2~0.base_165, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_214|, ~id_0~0=v_~id_0~0_274, ~contains_key_1~0.base=v_~contains_key_1~0.base_151} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_248|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_134|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_197|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_171|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_214|, ~contains_key_1~0.base=v_~contains_key_1~0.base_151, ~get_2~0.offset=v_~get_2~0.offset_163, #pthreadsForks=|v_#pthreadsForks_448|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_191|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_148, #memory_int=|v_#memory_int_752|, ~get_2~0.base=v_~get_2~0.base_165, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_194|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_122|, ~id_0~0=v_~id_0~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,781 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1860] L52-->L103-3: Formula: (and (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_120| 256) 0) (= (select (select |v_#memory_int_749| v_~contains_key_1~0.base_149) (+ v_~id_0~0_272 v_~contains_key_1~0.offset_146)) |v_thread1Thread1of1ForFork1_#t~mem3#1_120|) (= (+ |v_#pthreadsForks_445| 1) |v_#pthreadsForks_444|) (= (store |v_#memory_int_749| |v_ULTIMATE.start_main_~#t3~0#1.base_212| (store (select |v_#memory_int_749| |v_ULTIMATE.start_main_~#t3~0#1.base_212|) |v_ULTIMATE.start_main_~#t3~0#1.offset_195| |v_ULTIMATE.start_main_#t~pre50#1_189|)) |v_#memory_int_748|) (= |v_ULTIMATE.start_main_#t~pre50#1_189| |v_#pthreadsForks_445|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_192|)) InVars {#pthreadsForks=|v_#pthreadsForks_445|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_195|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_146, #memory_int=|v_#memory_int_749|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_212|, ~id_0~0=v_~id_0~0_272, ~contains_key_1~0.base=v_~contains_key_1~0.base_149} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_246|, #pthreadsForks=|v_#pthreadsForks_444|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_195|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_189|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_146, #memory_int=|v_#memory_int_748|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_169|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_212|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_192|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_120|, ~id_0~0=v_~id_0~0_272, ~contains_key_1~0.base=v_~contains_key_1~0.base_149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1887] L52-->L103-3: Formula: (and (= (store |v_#memory_int_1446| |v_ULTIMATE.start_main_~#t3~0#1.base_509| (store (select |v_#memory_int_1446| |v_ULTIMATE.start_main_~#t3~0#1.base_509|) |v_ULTIMATE.start_main_~#t3~0#1.offset_451| |v_ULTIMATE.start_main_#t~pre50#1_445|)) |v_#memory_int_1445|) (= |v_#pthreadsForks_1040| (+ |v_#pthreadsForks_1041| 1)) (not |v_thread1Thread1of1ForFork1_#t~short5#1_452|) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_239| 256) 0) (= |v_#pthreadsForks_1041| |v_ULTIMATE.start_main_#t~pre50#1_445|) (= (select (select |v_#memory_int_1446| v_~contains_key_1~0.base_375) (+ v_~id_0~0_547 v_~contains_key_1~0.offset_322)) |v_thread1Thread1of1ForFork1_#t~mem3#1_239|)) InVars {#pthreadsForks=|v_#pthreadsForks_1041|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_451|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_322, #memory_int=|v_#memory_int_1446|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_509|, ~id_0~0=v_~id_0~0_547, ~contains_key_1~0.base=v_~contains_key_1~0.base_375} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_544|, #pthreadsForks=|v_#pthreadsForks_1040|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_451|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_445|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_322, #memory_int=|v_#memory_int_1445|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_425|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_509|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_452|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_239|, ~id_0~0=v_~id_0~0_547, ~contains_key_1~0.base=v_~contains_key_1~0.base_375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1885] L52-->L103-3: Formula: (and (= |v_#memory_int_1437| (store |v_#memory_int_1438| |v_ULTIMATE.start_main_~#t3~0#1.base_505| (store (select |v_#memory_int_1438| |v_ULTIMATE.start_main_~#t3~0#1.base_505|) |v_ULTIMATE.start_main_~#t3~0#1.offset_447| |v_ULTIMATE.start_main_#t~pre50#1_441|))) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_233| 256) 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_446|) (= |v_#pthreadsForks_1032| (+ |v_#pthreadsForks_1033| 1)) (= |v_thread1Thread1of1ForFork1_#t~mem6#1_317| (select (select |v_#memory_int_1438| v_~get_2~0.base_441) (+ v_~get_2~0.offset_396 (* v_~id_0~0_543 4)))) (= |v_thread1Thread1of1ForFork1_#t~mem3#1_233| (select (select |v_#memory_int_1438| v_~contains_key_1~0.base_371) (+ v_~id_0~0_543 v_~contains_key_1~0.offset_318))) (= |v_#pthreadsForks_1033| |v_ULTIMATE.start_main_#t~pre50#1_441|)) InVars {~get_2~0.offset=v_~get_2~0.offset_396, #pthreadsForks=|v_#pthreadsForks_1033|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_447|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_318, #memory_int=|v_#memory_int_1438|, ~get_2~0.base=v_~get_2~0.base_441, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_505|, ~id_0~0=v_~id_0~0_543, ~contains_key_1~0.base=v_~contains_key_1~0.base_371} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_540|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_317|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_447|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_421|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_505|, ~contains_key_1~0.base=v_~contains_key_1~0.base_371, ~get_2~0.offset=v_~get_2~0.offset_396, #pthreadsForks=|v_#pthreadsForks_1032|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_441|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_318, #memory_int=|v_#memory_int_1437|, ~get_2~0.base=v_~get_2~0.base_441, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_446|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_233|, ~id_0~0=v_~id_0~0_543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:24,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1857] L52-6-->L103-3: Formula: (and (= (select (select |v_#memory_int_579| v_~get_2~0.base_107) (+ (* v_~id_0~0_197 4) v_~get_2~0.offset_107)) |v_thread1Thread1of1ForFork1_#t~mem6#1_94|) (= |v_#memory_int_578| (store |v_#memory_int_579| |v_ULTIMATE.start_main_~#t3~0#1.base_143| (store (select |v_#memory_int_579| |v_ULTIMATE.start_main_~#t3~0#1.base_143|) |v_ULTIMATE.start_main_~#t3~0#1.offset_139| |v_ULTIMATE.start_main_#t~pre50#1_133|))) (= |v_ULTIMATE.start_main_#t~pre50#1_133| |v_#pthreadsForks_295|) (= (+ |v_#pthreadsForks_295| 1) |v_#pthreadsForks_294|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_112|)) InVars {~get_2~0.offset=v_~get_2~0.offset_107, #pthreadsForks=|v_#pthreadsForks_295|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_139|, #memory_int=|v_#memory_int_579|, ~get_2~0.base=v_~get_2~0.base_107, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_112|, ~id_0~0=v_~id_0~0_197} OutVars{~get_2~0.offset=v_~get_2~0.offset_107, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_171|, #pthreadsForks=|v_#pthreadsForks_294|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_94|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_139|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_133|, #memory_int=|v_#memory_int_578|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_113|, ~get_2~0.base=v_~get_2~0.base_107, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_143|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_112|, ~id_0~0=v_~id_0~0_197} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1855] L52-6-->L103-3: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_36| 0) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_76|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_76| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_76|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|) (<= 0 (+ v_~result_9~0_104 2147483648)) (= |v_ULTIMATE.start_main_#t~pre50#1_131| |v_#pthreadsForks_287|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_52| (select (select |v_#memory_int_571| v_~get_2~0.base_103) (+ (* v_~id_0~0_193 4) v_~get_2~0.offset_103))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_36| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_50| |v_thread1Thread1of1ForFork1_minus_~b#1_76|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_52| |v_thread1Thread1of1ForFork1_minus_~a#1_76|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|) (= |v_#memory_int_570| (store |v_#memory_int_571| |v_ULTIMATE.start_main_~#t3~0#1.base_141| (store (select |v_#memory_int_571| |v_ULTIMATE.start_main_~#t3~0#1.base_141|) |v_ULTIMATE.start_main_~#t3~0#1.offset_137| |v_ULTIMATE.start_main_#t~pre50#1_131|))) (= v_~result_9~0_104 |v_thread1Thread1of1ForFork1_minus_#res#1_70|) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_70| |v_thread1Thread1of1ForFork1_minus_~b#1_76|) |v_thread1Thread1of1ForFork1_minus_~a#1_76|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_50| (select (select |v_#memory_int_571| v_~get_5~0.base_118) (+ v_~get_5~0.offset_118 (* v_~id_3~0_218 4)))) (not |v_thread1Thread1of1ForFork1_#t~short5#1_105|) (<= v_~result_9~0_104 2147483647) (= (+ |v_#pthreadsForks_287| 1) |v_#pthreadsForks_286|)) InVars {~get_2~0.offset=v_~get_2~0.offset_103, #pthreadsForks=|v_#pthreadsForks_287|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_137|, ~get_5~0.base=v_~get_5~0.base_118, ~id_3~0=v_~id_3~0_218, #memory_int=|v_#memory_int_571|, ~get_2~0.base=v_~get_2~0.base_103, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_105|, ~id_0~0=v_~id_0~0_193, ~get_5~0.offset=v_~get_5~0.offset_118} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_52|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_167|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_86|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_137|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_141|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_64|, ~result_9~0=v_~result_9~0_104, #pthreadsForks=|v_#pthreadsForks_286|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_62|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_131|, ~id_3~0=v_~id_3~0_218, ~get_2~0.base=v_~get_2~0.base_103, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_74|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_36|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_68|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_36|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_56|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_70|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_111|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_50|, ~get_2~0.offset=v_~get_2~0.offset_103, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_76|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|, ~get_5~0.base=v_~get_5~0.base_118, #memory_int=|v_#memory_int_570|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_76|, ~id_0~0=v_~id_0~0_193, ~get_5~0.offset=v_~get_5~0.offset_118} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre50#1, #memory_int, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:32:25,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:32:25,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1118 [2022-12-13 01:32:25,466 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 152 transitions, 2402 flow [2022-12-13 01:32:25,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:25,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:25,466 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, 1] [2022-12-13 01:32:25,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 01:32:25,466 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 01:32:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:25,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1262412186, now seen corresponding path program 1 times [2022-12-13 01:32:25,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:25,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482895958] [2022-12-13 01:32:25,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:25,855 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 01:32:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:25,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482895958] [2022-12-13 01:32:25,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482895958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:25,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:25,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206446248] [2022-12-13 01:32:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:25,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:25,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-13 01:32:25,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 152 transitions, 2402 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:25,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:25,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-13 01:32:25,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:26,956 INFO L130 PetriNetUnfolder]: 3894/6851 cut-off events. [2022-12-13 01:32:26,956 INFO L131 PetriNetUnfolder]: For 80476/80476 co-relation queries the response was YES. [2022-12-13 01:32:26,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33491 conditions, 6851 events. 3894/6851 cut-off events. For 80476/80476 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 48101 event pairs, 2316 based on Foata normal form. 4/6634 useless extension candidates. Maximal degree in co-relation 33434. Up to 4552 conditions per place. [2022-12-13 01:32:26,991 INFO L137 encePairwiseOnDemand]: 66/79 looper letters, 130 selfloop transitions, 28 changer transitions 19/177 dead transitions. [2022-12-13 01:32:26,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 177 transitions, 2410 flow [2022-12-13 01:32:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-12-13 01:32:26,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15471167369901548 [2022-12-13 01:32:26,993 INFO L175 Difference]: Start difference. First operand has 116 places, 152 transitions, 2402 flow. Second operand 9 states and 110 transitions. [2022-12-13 01:32:26,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 177 transitions, 2410 flow [2022-12-13 01:32:27,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 177 transitions, 2183 flow, removed 17 selfloop flow, removed 15 redundant places. [2022-12-13 01:32:27,229 INFO L231 Difference]: Finished difference. Result has 112 places, 117 transitions, 1561 flow [2022-12-13 01:32:27,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1561, PETRI_PLACES=112, PETRI_TRANSITIONS=117} [2022-12-13 01:32:27,229 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2022-12-13 01:32:27,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:27,230 INFO L89 Accepts]: Start accepts. Operand has 112 places, 117 transitions, 1561 flow [2022-12-13 01:32:27,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:27,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:27,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 117 transitions, 1561 flow [2022-12-13 01:32:27,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 117 transitions, 1561 flow [2022-12-13 01:32:27,311 INFO L130 PetriNetUnfolder]: 126/893 cut-off events. [2022-12-13 01:32:27,311 INFO L131 PetriNetUnfolder]: For 10636/10812 co-relation queries the response was YES. [2022-12-13 01:32:27,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 893 events. 126/893 cut-off events. For 10636/10812 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8627 event pairs, 0 based on Foata normal form. 56/913 useless extension candidates. Maximal degree in co-relation 3505. Up to 114 conditions per place. [2022-12-13 01:32:27,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 117 transitions, 1561 flow [2022-12-13 01:32:27,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 1014 [2022-12-13 01:32:27,321 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:27,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 01:32:27,322 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 117 transitions, 1561 flow [2022-12-13 01:32:27,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:27,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:27,322 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, 1] [2022-12-13 01:32:27,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 01:32:27,323 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 01:32:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash 332732536, now seen corresponding path program 1 times [2022-12-13 01:32:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:27,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305843714] [2022-12-13 01:32:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:27,851 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 01:32:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:27,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305843714] [2022-12-13 01:32:27,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305843714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:27,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:27,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691737654] [2022-12-13 01:32:27,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:27,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:27,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:32:27,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 117 transitions, 1561 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:27,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:27,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:32:27,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:29,003 INFO L130 PetriNetUnfolder]: 3975/7029 cut-off events. [2022-12-13 01:32:29,003 INFO L131 PetriNetUnfolder]: For 74680/74680 co-relation queries the response was YES. [2022-12-13 01:32:29,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31974 conditions, 7029 events. 3975/7029 cut-off events. For 74680/74680 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 49709 event pairs, 2879 based on Foata normal form. 1/6825 useless extension candidates. Maximal degree in co-relation 31921. Up to 6426 conditions per place. [2022-12-13 01:32:29,041 INFO L137 encePairwiseOnDemand]: 49/57 looper letters, 157 selfloop transitions, 10 changer transitions 10/177 dead transitions. [2022-12-13 01:32:29,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 177 transitions, 2423 flow [2022-12-13 01:32:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 01:32:29,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2022-12-13 01:32:29,044 INFO L175 Difference]: Start difference. First operand has 110 places, 117 transitions, 1561 flow. Second operand 8 states and 104 transitions. [2022-12-13 01:32:29,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 177 transitions, 2423 flow [2022-12-13 01:32:29,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 177 transitions, 2318 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-13 01:32:29,223 INFO L231 Difference]: Finished difference. Result has 114 places, 123 transitions, 1645 flow [2022-12-13 01:32:29,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1645, PETRI_PLACES=114, PETRI_TRANSITIONS=123} [2022-12-13 01:32:29,223 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2022-12-13 01:32:29,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:29,224 INFO L89 Accepts]: Start accepts. Operand has 114 places, 123 transitions, 1645 flow [2022-12-13 01:32:29,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:29,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:29,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 123 transitions, 1645 flow [2022-12-13 01:32:29,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 1645 flow [2022-12-13 01:32:29,310 INFO L130 PetriNetUnfolder]: 130/1005 cut-off events. [2022-12-13 01:32:29,310 INFO L131 PetriNetUnfolder]: For 11183/11370 co-relation queries the response was YES. [2022-12-13 01:32:29,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 1005 events. 130/1005 cut-off events. For 11183/11370 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10200 event pairs, 0 based on Foata normal form. 57/1024 useless extension candidates. Maximal degree in co-relation 3888. Up to 122 conditions per place. [2022-12-13 01:32:29,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 123 transitions, 1645 flow [2022-12-13 01:32:29,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 1046 [2022-12-13 01:32:29,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:32:29,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:32:29,567 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:32:29,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 343 [2022-12-13 01:32:29,567 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 125 transitions, 1713 flow [2022-12-13 01:32:29,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:29,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:29,568 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, 1] [2022-12-13 01:32:29,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 01:32:29,568 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 01:32:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1340755174, now seen corresponding path program 1 times [2022-12-13 01:32:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:29,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160005352] [2022-12-13 01:32:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:30,204 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 01:32:30,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:30,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160005352] [2022-12-13 01:32:30,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160005352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:30,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:30,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388750401] [2022-12-13 01:32:30,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:30,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:30,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:30,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:32:30,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 125 transitions, 1713 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:30,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:30,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:32:30,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:31,368 INFO L130 PetriNetUnfolder]: 3990/7090 cut-off events. [2022-12-13 01:32:31,369 INFO L131 PetriNetUnfolder]: For 73701/73701 co-relation queries the response was YES. [2022-12-13 01:32:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32266 conditions, 7090 events. 3990/7090 cut-off events. For 73701/73701 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 50734 event pairs, 2636 based on Foata normal form. 3/6888 useless extension candidates. Maximal degree in co-relation 32211. Up to 6191 conditions per place. [2022-12-13 01:32:31,410 INFO L137 encePairwiseOnDemand]: 50/59 looper letters, 159 selfloop transitions, 9 changer transitions 14/182 dead transitions. [2022-12-13 01:32:31,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 182 transitions, 2519 flow [2022-12-13 01:32:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-12-13 01:32:31,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1902071563088512 [2022-12-13 01:32:31,411 INFO L175 Difference]: Start difference. First operand has 114 places, 125 transitions, 1713 flow. Second operand 9 states and 101 transitions. [2022-12-13 01:32:31,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 182 transitions, 2519 flow [2022-12-13 01:32:31,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 182 transitions, 2499 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 01:32:31,608 INFO L231 Difference]: Finished difference. Result has 123 places, 127 transitions, 1743 flow [2022-12-13 01:32:31,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1743, PETRI_PLACES=123, PETRI_TRANSITIONS=127} [2022-12-13 01:32:31,609 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places. [2022-12-13 01:32:31,609 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:31,609 INFO L89 Accepts]: Start accepts. Operand has 123 places, 127 transitions, 1743 flow [2022-12-13 01:32:31,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:31,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:31,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 127 transitions, 1743 flow [2022-12-13 01:32:31,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 127 transitions, 1743 flow [2022-12-13 01:32:31,727 INFO L130 PetriNetUnfolder]: 136/1035 cut-off events. [2022-12-13 01:32:31,727 INFO L131 PetriNetUnfolder]: For 12198/12391 co-relation queries the response was YES. [2022-12-13 01:32:31,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1035 events. 136/1035 cut-off events. For 12198/12391 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10538 event pairs, 0 based on Foata normal form. 59/1060 useless extension candidates. Maximal degree in co-relation 4099. Up to 128 conditions per place. [2022-12-13 01:32:31,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 127 transitions, 1743 flow [2022-12-13 01:32:31,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-13 01:32:31,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:32:31,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-13 01:32:31,919 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 126 transitions, 1740 flow [2022-12-13 01:32:31,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:31,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:31,919 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, 1] [2022-12-13 01:32:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 01:32:31,919 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 01:32:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2095632454, now seen corresponding path program 2 times [2022-12-13 01:32:31,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:31,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273983691] [2022-12-13 01:32:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:31,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:32,282 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 01:32:32,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273983691] [2022-12-13 01:32:32,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273983691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:32,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:32,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143694121] [2022-12-13 01:32:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:32,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:32,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:32,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:32,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:32:32,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 126 transitions, 1740 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:32,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:32,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:32:32,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:33,363 INFO L130 PetriNetUnfolder]: 3936/6971 cut-off events. [2022-12-13 01:32:33,363 INFO L131 PetriNetUnfolder]: For 72340/72340 co-relation queries the response was YES. [2022-12-13 01:32:33,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32366 conditions, 6971 events. 3936/6971 cut-off events. For 72340/72340 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 49838 event pairs, 2015 based on Foata normal form. 5/6771 useless extension candidates. Maximal degree in co-relation 32307. Up to 4279 conditions per place. [2022-12-13 01:32:33,404 INFO L137 encePairwiseOnDemand]: 44/59 looper letters, 154 selfloop transitions, 25 changer transitions 11/190 dead transitions. [2022-12-13 01:32:33,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 190 transitions, 2601 flow [2022-12-13 01:32:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-12-13 01:32:33,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22033898305084745 [2022-12-13 01:32:33,405 INFO L175 Difference]: Start difference. First operand has 120 places, 126 transitions, 1740 flow. Second operand 9 states and 117 transitions. [2022-12-13 01:32:33,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 190 transitions, 2601 flow [2022-12-13 01:32:33,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 190 transitions, 2537 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-12-13 01:32:33,668 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 1874 flow [2022-12-13 01:32:33,669 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1874, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2022-12-13 01:32:33,669 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 84 predicate places. [2022-12-13 01:32:33,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:33,669 INFO L89 Accepts]: Start accepts. Operand has 126 places, 130 transitions, 1874 flow [2022-12-13 01:32:33,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:33,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:33,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 130 transitions, 1874 flow [2022-12-13 01:32:33,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 130 transitions, 1874 flow [2022-12-13 01:32:33,759 INFO L130 PetriNetUnfolder]: 136/995 cut-off events. [2022-12-13 01:32:33,759 INFO L131 PetriNetUnfolder]: For 13501/13696 co-relation queries the response was YES. [2022-12-13 01:32:33,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 995 events. 136/995 cut-off events. For 13501/13696 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10020 event pairs, 0 based on Foata normal form. 59/1018 useless extension candidates. Maximal degree in co-relation 4088. Up to 122 conditions per place. [2022-12-13 01:32:33,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 130 transitions, 1874 flow [2022-12-13 01:32:33,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 1090 [2022-12-13 01:32:33,771 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:33,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 01:32:33,772 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 130 transitions, 1874 flow [2022-12-13 01:32:33,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:33,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:33,772 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 01:32:33,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 01:32:33,772 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 01:32:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -228072707, now seen corresponding path program 1 times [2022-12-13 01:32:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:33,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653303218] [2022-12-13 01:32:33,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:33,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:34,299 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 01:32:34,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:34,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653303218] [2022-12-13 01:32:34,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653303218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:34,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:34,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445273565] [2022-12-13 01:32:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:34,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:34,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:34,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:32:34,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 130 transitions, 1874 flow. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:32:34,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:34,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:32:34,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:35,425 INFO L130 PetriNetUnfolder]: 3992/7121 cut-off events. [2022-12-13 01:32:35,426 INFO L131 PetriNetUnfolder]: For 84983/84983 co-relation queries the response was YES. [2022-12-13 01:32:35,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33760 conditions, 7121 events. 3992/7121 cut-off events. For 84983/84983 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 51319 event pairs, 2635 based on Foata normal form. 3/6919 useless extension candidates. Maximal degree in co-relation 33700. Up to 6140 conditions per place. [2022-12-13 01:32:35,467 INFO L137 encePairwiseOnDemand]: 50/59 looper letters, 172 selfloop transitions, 8 changer transitions 10/190 dead transitions. [2022-12-13 01:32:35,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 190 transitions, 2765 flow [2022-12-13 01:32:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-13 01:32:35,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2266949152542373 [2022-12-13 01:32:35,468 INFO L175 Difference]: Start difference. First operand has 125 places, 130 transitions, 1874 flow. Second operand 8 states and 107 transitions. [2022-12-13 01:32:35,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 190 transitions, 2765 flow [2022-12-13 01:32:35,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 190 transitions, 2727 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:32:35,726 INFO L231 Difference]: Finished difference. Result has 131 places, 132 transitions, 1908 flow [2022-12-13 01:32:35,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1908, PETRI_PLACES=131, PETRI_TRANSITIONS=132} [2022-12-13 01:32:35,727 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2022-12-13 01:32:35,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:35,727 INFO L89 Accepts]: Start accepts. Operand has 131 places, 132 transitions, 1908 flow [2022-12-13 01:32:35,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:35,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:35,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 132 transitions, 1908 flow [2022-12-13 01:32:35,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 132 transitions, 1908 flow [2022-12-13 01:32:35,839 INFO L130 PetriNetUnfolder]: 139/1061 cut-off events. [2022-12-13 01:32:35,840 INFO L131 PetriNetUnfolder]: For 14134/14336 co-relation queries the response was YES. [2022-12-13 01:32:35,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 1061 events. 139/1061 cut-off events. For 14134/14336 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10914 event pairs, 0 based on Foata normal form. 60/1087 useless extension candidates. Maximal degree in co-relation 4318. Up to 122 conditions per place. [2022-12-13 01:32:35,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 132 transitions, 1908 flow [2022-12-13 01:32:35,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 1098 [2022-12-13 01:32:35,850 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:35,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:32:35,851 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 132 transitions, 1908 flow [2022-12-13 01:32:35,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:32:35,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:35,851 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 01:32:35,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 01:32:35,851 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 01:32:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1525597195, now seen corresponding path program 2 times [2022-12-13 01:32:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:35,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083018817] [2022-12-13 01:32:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:36,287 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 01:32:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:36,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083018817] [2022-12-13 01:32:36,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083018817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:36,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:36,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:32:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076435] [2022-12-13 01:32:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:36,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:32:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:32:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:32:36,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:32:36,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 132 transitions, 1908 flow. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 01:32:36,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:36,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:32:36,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:37,583 INFO L130 PetriNetUnfolder]: 4532/8161 cut-off events. [2022-12-13 01:32:37,583 INFO L131 PetriNetUnfolder]: For 94120/94120 co-relation queries the response was YES. [2022-12-13 01:32:37,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38469 conditions, 8161 events. 4532/8161 cut-off events. For 94120/94120 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 60551 event pairs, 2530 based on Foata normal form. 3/7959 useless extension candidates. Maximal degree in co-relation 38407. Up to 6289 conditions per place. [2022-12-13 01:32:37,628 INFO L137 encePairwiseOnDemand]: 45/59 looper letters, 195 selfloop transitions, 22 changer transitions 9/226 dead transitions. [2022-12-13 01:32:37,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 226 transitions, 3374 flow [2022-12-13 01:32:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-12-13 01:32:37,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23728813559322035 [2022-12-13 01:32:37,629 INFO L175 Difference]: Start difference. First operand has 130 places, 132 transitions, 1908 flow. Second operand 8 states and 112 transitions. [2022-12-13 01:32:37,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 226 transitions, 3374 flow [2022-12-13 01:32:37,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 226 transitions, 3350 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:37,928 INFO L231 Difference]: Finished difference. Result has 134 places, 144 transitions, 2118 flow [2022-12-13 01:32:37,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2118, PETRI_PLACES=134, PETRI_TRANSITIONS=144} [2022-12-13 01:32:37,928 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2022-12-13 01:32:37,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:37,929 INFO L89 Accepts]: Start accepts. Operand has 134 places, 144 transitions, 2118 flow [2022-12-13 01:32:37,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:37,930 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:37,930 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 144 transitions, 2118 flow [2022-12-13 01:32:37,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 144 transitions, 2118 flow [2022-12-13 01:32:38,057 INFO L130 PetriNetUnfolder]: 186/1318 cut-off events. [2022-12-13 01:32:38,057 INFO L131 PetriNetUnfolder]: For 16674/16955 co-relation queries the response was YES. [2022-12-13 01:32:38,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 1318 events. 186/1318 cut-off events. For 16674/16955 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14109 event pairs, 6 based on Foata normal form. 75/1367 useless extension candidates. Maximal degree in co-relation 5446. Up to 149 conditions per place. [2022-12-13 01:32:38,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 144 transitions, 2118 flow [2022-12-13 01:32:38,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 1160 [2022-12-13 01:32:38,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:38,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:32:38,073 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 144 transitions, 2118 flow [2022-12-13 01:32:38,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 01:32:38,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:38,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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:32:38,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 01:32:38,073 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 01:32:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1061847476, now seen corresponding path program 3 times [2022-12-13 01:32:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:38,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817541244] [2022-12-13 01:32:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:38,515 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 01:32:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817541244] [2022-12-13 01:32:38,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817541244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:38,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:38,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650286221] [2022-12-13 01:32:38,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:38,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:38,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:38,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:38,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:38,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:32:38,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 144 transitions, 2118 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:38,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:38,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:32:38,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:39,807 INFO L130 PetriNetUnfolder]: 4511/8114 cut-off events. [2022-12-13 01:32:39,807 INFO L131 PetriNetUnfolder]: For 96056/96056 co-relation queries the response was YES. [2022-12-13 01:32:39,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39974 conditions, 8114 events. 4511/8114 cut-off events. For 96056/96056 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 60201 event pairs, 2409 based on Foata normal form. 5/8114 useless extension candidates. Maximal degree in co-relation 39911. Up to 5343 conditions per place. [2022-12-13 01:32:39,858 INFO L137 encePairwiseOnDemand]: 44/57 looper letters, 154 selfloop transitions, 23 changer transitions 17/194 dead transitions. [2022-12-13 01:32:39,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 194 transitions, 2783 flow [2022-12-13 01:32:39,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-12-13 01:32:39,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21442495126705652 [2022-12-13 01:32:39,860 INFO L175 Difference]: Start difference. First operand has 133 places, 144 transitions, 2118 flow. Second operand 9 states and 110 transitions. [2022-12-13 01:32:39,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 194 transitions, 2783 flow [2022-12-13 01:32:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 194 transitions, 2764 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 01:32:40,241 INFO L231 Difference]: Finished difference. Result has 139 places, 139 transitions, 2035 flow [2022-12-13 01:32:40,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2035, PETRI_PLACES=139, PETRI_TRANSITIONS=139} [2022-12-13 01:32:40,242 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2022-12-13 01:32:40,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:40,242 INFO L89 Accepts]: Start accepts. Operand has 139 places, 139 transitions, 2035 flow [2022-12-13 01:32:40,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:40,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:40,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 2035 flow [2022-12-13 01:32:40,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 139 transitions, 2035 flow [2022-12-13 01:32:40,369 INFO L130 PetriNetUnfolder]: 183/1273 cut-off events. [2022-12-13 01:32:40,369 INFO L131 PetriNetUnfolder]: For 16657/16934 co-relation queries the response was YES. [2022-12-13 01:32:40,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5356 conditions, 1273 events. 183/1273 cut-off events. For 16657/16934 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13447 event pairs, 5 based on Foata normal form. 75/1321 useless extension candidates. Maximal degree in co-relation 5300. Up to 148 conditions per place. [2022-12-13 01:32:40,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 139 transitions, 2035 flow [2022-12-13 01:32:40,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 1142 [2022-12-13 01:32:40,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:32:40,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-13 01:32:40,598 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 138 transitions, 2035 flow [2022-12-13 01:32:40,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:40,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:40,598 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, 1] [2022-12-13 01:32:40,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 01:32:40,599 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 01:32:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1021194152, now seen corresponding path program 2 times [2022-12-13 01:32:40,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:40,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157672365] [2022-12-13 01:32:40,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:40,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:41,092 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 01:32:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157672365] [2022-12-13 01:32:41,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157672365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:41,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:41,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9398845] [2022-12-13 01:32:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:41,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:41,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:32:41,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 138 transitions, 2035 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:41,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:41,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:32:41,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:42,411 INFO L130 PetriNetUnfolder]: 4464/7983 cut-off events. [2022-12-13 01:32:42,411 INFO L131 PetriNetUnfolder]: For 99617/99617 co-relation queries the response was YES. [2022-12-13 01:32:42,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39320 conditions, 7983 events. 4464/7983 cut-off events. For 99617/99617 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 58243 event pairs, 3256 based on Foata normal form. 1/7979 useless extension candidates. Maximal degree in co-relation 39256. Up to 7413 conditions per place. [2022-12-13 01:32:42,469 INFO L137 encePairwiseOnDemand]: 49/59 looper letters, 179 selfloop transitions, 10 changer transitions 9/198 dead transitions. [2022-12-13 01:32:42,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 198 transitions, 3083 flow [2022-12-13 01:32:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-12-13 01:32:42,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22245762711864406 [2022-12-13 01:32:42,470 INFO L175 Difference]: Start difference. First operand has 135 places, 138 transitions, 2035 flow. Second operand 8 states and 105 transitions. [2022-12-13 01:32:42,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 198 transitions, 3083 flow [2022-12-13 01:32:42,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 198 transitions, 2935 flow, removed 42 selfloop flow, removed 8 redundant places. [2022-12-13 01:32:42,827 INFO L231 Difference]: Finished difference. Result has 138 places, 143 transitions, 2096 flow [2022-12-13 01:32:42,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2096, PETRI_PLACES=138, PETRI_TRANSITIONS=143} [2022-12-13 01:32:42,828 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places. [2022-12-13 01:32:42,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:42,828 INFO L89 Accepts]: Start accepts. Operand has 138 places, 143 transitions, 2096 flow [2022-12-13 01:32:42,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:42,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:42,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 143 transitions, 2096 flow [2022-12-13 01:32:42,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 143 transitions, 2096 flow [2022-12-13 01:32:42,963 INFO L130 PetriNetUnfolder]: 183/1259 cut-off events. [2022-12-13 01:32:42,963 INFO L131 PetriNetUnfolder]: For 16096/16379 co-relation queries the response was YES. [2022-12-13 01:32:42,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 1259 events. 183/1259 cut-off events. For 16096/16379 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13215 event pairs, 5 based on Foata normal form. 75/1307 useless extension candidates. Maximal degree in co-relation 5168. Up to 147 conditions per place. [2022-12-13 01:32:42,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 143 transitions, 2096 flow [2022-12-13 01:32:42,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-13 01:32:42,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:32:43,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:32:43,211 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:32:43,211 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-13 01:32:43,211 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 143 transitions, 2119 flow [2022-12-13 01:32:43,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:43,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:43,212 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 01:32:43,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 01:32:43,212 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 01:32:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash -721984553, now seen corresponding path program 1 times [2022-12-13 01:32:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069666921] [2022-12-13 01:32:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:43,578 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 01:32:43,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:43,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069666921] [2022-12-13 01:32:43,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069666921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:43,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:43,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:32:43,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379213431] [2022-12-13 01:32:43,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:43,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:32:43,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:43,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:32:43,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:32:43,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 01:32:43,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 143 transitions, 2119 flow. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 01:32:43,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:43,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 01:32:43,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:44,871 INFO L130 PetriNetUnfolder]: 4443/7945 cut-off events. [2022-12-13 01:32:44,872 INFO L131 PetriNetUnfolder]: For 92859/92859 co-relation queries the response was YES. [2022-12-13 01:32:44,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38728 conditions, 7945 events. 4443/7945 cut-off events. For 92859/92859 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 58146 event pairs, 2675 based on Foata normal form. 3/7943 useless extension candidates. Maximal degree in co-relation 38663. Up to 6784 conditions per place. [2022-12-13 01:32:44,917 INFO L137 encePairwiseOnDemand]: 47/61 looper letters, 168 selfloop transitions, 22 changer transitions 14/204 dead transitions. [2022-12-13 01:32:44,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 204 transitions, 3184 flow [2022-12-13 01:32:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-12-13 01:32:44,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20901639344262296 [2022-12-13 01:32:44,918 INFO L175 Difference]: Start difference. First operand has 138 places, 143 transitions, 2119 flow. Second operand 8 states and 102 transitions. [2022-12-13 01:32:44,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 204 transitions, 3184 flow [2022-12-13 01:32:45,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 204 transitions, 3162 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:45,220 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 2019 flow [2022-12-13 01:32:45,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2019, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2022-12-13 01:32:45,221 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2022-12-13 01:32:45,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:45,221 INFO L89 Accepts]: Start accepts. Operand has 141 places, 139 transitions, 2019 flow [2022-12-13 01:32:45,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:45,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:45,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 139 transitions, 2019 flow [2022-12-13 01:32:45,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 139 transitions, 2019 flow [2022-12-13 01:32:45,344 INFO L130 PetriNetUnfolder]: 175/1224 cut-off events. [2022-12-13 01:32:45,344 INFO L131 PetriNetUnfolder]: For 14976/15243 co-relation queries the response was YES. [2022-12-13 01:32:45,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 1224 events. 175/1224 cut-off events. For 14976/15243 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12830 event pairs, 5 based on Foata normal form. 70/1267 useless extension candidates. Maximal degree in co-relation 5089. Up to 145 conditions per place. [2022-12-13 01:32:45,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 139 transitions, 2019 flow [2022-12-13 01:32:45,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 1144 [2022-12-13 01:32:45,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:32:45,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:32:45,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-13 01:32:45,500 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 139 transitions, 2028 flow [2022-12-13 01:32:45,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 01:32:45,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:45,500 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 01:32:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 01:32:45,500 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 01:32:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -578137729, now seen corresponding path program 1 times [2022-12-13 01:32:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:45,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51090123] [2022-12-13 01:32:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:45,885 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 01:32:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:45,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51090123] [2022-12-13 01:32:45,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51090123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:45,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:45,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871820955] [2022-12-13 01:32:45,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:45,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:45,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:45,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:45,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:45,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:32:45,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 139 transitions, 2028 flow. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:32:45,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:45,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:32:45,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:47,086 INFO L130 PetriNetUnfolder]: 4424/7892 cut-off events. [2022-12-13 01:32:47,086 INFO L131 PetriNetUnfolder]: For 94281/94281 co-relation queries the response was YES. [2022-12-13 01:32:47,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39135 conditions, 7892 events. 4424/7892 cut-off events. For 94281/94281 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 57320 event pairs, 3141 based on Foata normal form. 1/7888 useless extension candidates. Maximal degree in co-relation 39071. Up to 7375 conditions per place. [2022-12-13 01:32:47,132 INFO L137 encePairwiseOnDemand]: 52/59 looper letters, 158 selfloop transitions, 12 changer transitions 8/178 dead transitions. [2022-12-13 01:32:47,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 178 transitions, 2709 flow [2022-12-13 01:32:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:32:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:32:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-13 01:32:47,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22760290556900725 [2022-12-13 01:32:47,133 INFO L175 Difference]: Start difference. First operand has 139 places, 139 transitions, 2028 flow. Second operand 7 states and 94 transitions. [2022-12-13 01:32:47,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 178 transitions, 2709 flow [2022-12-13 01:32:47,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 178 transitions, 2649 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-13 01:32:47,423 INFO L231 Difference]: Finished difference. Result has 140 places, 145 transitions, 2134 flow [2022-12-13 01:32:47,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2134, PETRI_PLACES=140, PETRI_TRANSITIONS=145} [2022-12-13 01:32:47,423 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 98 predicate places. [2022-12-13 01:32:47,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:47,423 INFO L89 Accepts]: Start accepts. Operand has 140 places, 145 transitions, 2134 flow [2022-12-13 01:32:47,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:47,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:47,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 145 transitions, 2134 flow [2022-12-13 01:32:47,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 145 transitions, 2134 flow [2022-12-13 01:32:47,542 INFO L130 PetriNetUnfolder]: 174/1216 cut-off events. [2022-12-13 01:32:47,542 INFO L131 PetriNetUnfolder]: For 14897/15159 co-relation queries the response was YES. [2022-12-13 01:32:47,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 1216 events. 174/1216 cut-off events. For 14897/15159 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12739 event pairs, 5 based on Foata normal form. 69/1258 useless extension candidates. Maximal degree in co-relation 4964. Up to 144 conditions per place. [2022-12-13 01:32:47,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 145 transitions, 2134 flow [2022-12-13 01:32:47,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-13 01:32:47,553 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:47,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:32:47,553 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 145 transitions, 2134 flow [2022-12-13 01:32:47,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:32:47,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:47,554 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, 1] [2022-12-13 01:32:47,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 01:32:47,554 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 01:32:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 742235246, now seen corresponding path program 3 times [2022-12-13 01:32:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:47,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7596899] [2022-12-13 01:32:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:47,983 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 01:32:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7596899] [2022-12-13 01:32:47,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7596899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:47,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:47,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:32:47,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199136962] [2022-12-13 01:32:47,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:32:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:32:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:32:47,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:32:47,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 145 transitions, 2134 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:32:47,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:47,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:32:47,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:49,305 INFO L130 PetriNetUnfolder]: 4907/8814 cut-off events. [2022-12-13 01:32:49,305 INFO L131 PetriNetUnfolder]: For 101581/101581 co-relation queries the response was YES. [2022-12-13 01:32:49,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42658 conditions, 8814 events. 4907/8814 cut-off events. For 101581/101581 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 66744 event pairs, 1769 based on Foata normal form. 3/8812 useless extension candidates. Maximal degree in co-relation 42594. Up to 4251 conditions per place. [2022-12-13 01:32:49,365 INFO L137 encePairwiseOnDemand]: 44/57 looper letters, 221 selfloop transitions, 26 changer transitions 14/261 dead transitions. [2022-12-13 01:32:49,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 261 transitions, 3991 flow [2022-12-13 01:32:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:32:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:32:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 01:32:49,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3007518796992481 [2022-12-13 01:32:49,367 INFO L175 Difference]: Start difference. First operand has 137 places, 145 transitions, 2134 flow. Second operand 7 states and 120 transitions. [2022-12-13 01:32:49,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 261 transitions, 3991 flow [2022-12-13 01:32:49,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 261 transitions, 3957 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 01:32:49,746 INFO L231 Difference]: Finished difference. Result has 143 places, 153 transitions, 2388 flow [2022-12-13 01:32:49,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2388, PETRI_PLACES=143, PETRI_TRANSITIONS=153} [2022-12-13 01:32:49,746 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2022-12-13 01:32:49,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:49,746 INFO L89 Accepts]: Start accepts. Operand has 143 places, 153 transitions, 2388 flow [2022-12-13 01:32:49,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:49,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:49,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 153 transitions, 2388 flow [2022-12-13 01:32:49,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 153 transitions, 2388 flow [2022-12-13 01:32:49,893 INFO L130 PetriNetUnfolder]: 185/1355 cut-off events. [2022-12-13 01:32:49,893 INFO L131 PetriNetUnfolder]: For 16393/16657 co-relation queries the response was YES. [2022-12-13 01:32:49,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5584 conditions, 1355 events. 185/1355 cut-off events. For 16393/16657 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14648 event pairs, 8 based on Foata normal form. 70/1391 useless extension candidates. Maximal degree in co-relation 5526. Up to 160 conditions per place. [2022-12-13 01:32:49,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 153 transitions, 2388 flow [2022-12-13 01:32:49,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 1262 [2022-12-13 01:32:49,912 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:49,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 01:32:49,913 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 153 transitions, 2388 flow [2022-12-13 01:32:49,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:32:49,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:49,913 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, 1] [2022-12-13 01:32:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 01:32:49,913 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 01:32:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash -146620886, now seen corresponding path program 4 times [2022-12-13 01:32:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:49,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166395330] [2022-12-13 01:32:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:50,380 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 01:32:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166395330] [2022-12-13 01:32:50,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166395330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:50,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:50,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683732237] [2022-12-13 01:32:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:50,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:50,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:32:50,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 153 transitions, 2388 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:50,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:50,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:32:50,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:51,790 INFO L130 PetriNetUnfolder]: 4851/8696 cut-off events. [2022-12-13 01:32:51,790 INFO L131 PetriNetUnfolder]: For 106445/106445 co-relation queries the response was YES. [2022-12-13 01:32:51,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42824 conditions, 8696 events. 4851/8696 cut-off events. For 106445/106445 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 64782 event pairs, 3001 based on Foata normal form. 5/8695 useless extension candidates. Maximal degree in co-relation 42758. Up to 5955 conditions per place. [2022-12-13 01:32:51,844 INFO L137 encePairwiseOnDemand]: 44/57 looper letters, 153 selfloop transitions, 21 changer transitions 21/195 dead transitions. [2022-12-13 01:32:51,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 195 transitions, 2945 flow [2022-12-13 01:32:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-13 01:32:51,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20272904483430798 [2022-12-13 01:32:51,845 INFO L175 Difference]: Start difference. First operand has 142 places, 153 transitions, 2388 flow. Second operand 9 states and 104 transitions. [2022-12-13 01:32:51,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 195 transitions, 2945 flow [2022-12-13 01:32:52,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 195 transitions, 2916 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 01:32:52,256 INFO L231 Difference]: Finished difference. Result has 148 places, 141 transitions, 2137 flow [2022-12-13 01:32:52,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2364, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2137, PETRI_PLACES=148, PETRI_TRANSITIONS=141} [2022-12-13 01:32:52,256 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2022-12-13 01:32:52,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:52,256 INFO L89 Accepts]: Start accepts. Operand has 148 places, 141 transitions, 2137 flow [2022-12-13 01:32:52,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:52,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:52,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 141 transitions, 2137 flow [2022-12-13 01:32:52,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 141 transitions, 2137 flow [2022-12-13 01:32:52,395 INFO L130 PetriNetUnfolder]: 190/1352 cut-off events. [2022-12-13 01:32:52,395 INFO L131 PetriNetUnfolder]: For 16035/16292 co-relation queries the response was YES. [2022-12-13 01:32:52,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 1352 events. 190/1352 cut-off events. For 16035/16292 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14576 event pairs, 8 based on Foata normal form. 69/1384 useless extension candidates. Maximal degree in co-relation 5512. Up to 164 conditions per place. [2022-12-13 01:32:52,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 141 transitions, 2137 flow [2022-12-13 01:32:52,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-13 01:32:52,408 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:52,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 01:32:52,409 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 141 transitions, 2137 flow [2022-12-13 01:32:52,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:52,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:52,409 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, 1] [2022-12-13 01:32:52,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 01:32:52,409 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 01:32:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1590180284, now seen corresponding path program 1 times [2022-12-13 01:32:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:52,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508667178] [2022-12-13 01:32:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:52,963 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 01:32:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:52,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508667178] [2022-12-13 01:32:52,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508667178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:52,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833239078] [2022-12-13 01:32:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:52,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:52,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:52,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:32:52,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 141 transitions, 2137 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:52,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:52,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:32:52,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:54,371 INFO L130 PetriNetUnfolder]: 4789/8544 cut-off events. [2022-12-13 01:32:54,371 INFO L131 PetriNetUnfolder]: For 104217/104217 co-relation queries the response was YES. [2022-12-13 01:32:54,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41742 conditions, 8544 events. 4789/8544 cut-off events. For 104217/104217 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 62975 event pairs, 3502 based on Foata normal form. 1/8540 useless extension candidates. Maximal degree in co-relation 41675. Up to 8268 conditions per place. [2022-12-13 01:32:54,433 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 155 selfloop transitions, 5 changer transitions 18/178 dead transitions. [2022-12-13 01:32:54,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 178 transitions, 2718 flow [2022-12-13 01:32:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:32:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:32:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-13 01:32:54,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-13 01:32:54,434 INFO L175 Difference]: Start difference. First operand has 146 places, 141 transitions, 2137 flow. Second operand 8 states and 95 transitions. [2022-12-13 01:32:54,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 178 transitions, 2718 flow [2022-12-13 01:32:54,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 178 transitions, 2590 flow, removed 31 selfloop flow, removed 10 redundant places. [2022-12-13 01:32:54,860 INFO L231 Difference]: Finished difference. Result has 147 places, 143 transitions, 2077 flow [2022-12-13 01:32:54,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2077, PETRI_PLACES=147, PETRI_TRANSITIONS=143} [2022-12-13 01:32:54,861 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2022-12-13 01:32:54,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:54,861 INFO L89 Accepts]: Start accepts. Operand has 147 places, 143 transitions, 2077 flow [2022-12-13 01:32:54,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:54,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:54,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 143 transitions, 2077 flow [2022-12-13 01:32:54,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 143 transitions, 2077 flow [2022-12-13 01:32:55,006 INFO L130 PetriNetUnfolder]: 182/1305 cut-off events. [2022-12-13 01:32:55,006 INFO L131 PetriNetUnfolder]: For 14110/14365 co-relation queries the response was YES. [2022-12-13 01:32:55,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5213 conditions, 1305 events. 182/1305 cut-off events. For 14110/14365 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13923 event pairs, 8 based on Foata normal form. 67/1339 useless extension candidates. Maximal degree in co-relation 5154. Up to 154 conditions per place. [2022-12-13 01:32:55,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 143 transitions, 2077 flow [2022-12-13 01:32:55,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 1190 [2022-12-13 01:32:55,017 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:55,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 01:32:55,018 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 2077 flow [2022-12-13 01:32:55,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:55,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:55,018 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, 1] [2022-12-13 01:32:55,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 01:32:55,018 INFO L420 AbstractCegarLoop]: === Iteration 53 === 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 01:32:55,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 860617584, now seen corresponding path program 5 times [2022-12-13 01:32:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:55,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109353956] [2022-12-13 01:32:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:55,360 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 01:32:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109353956] [2022-12-13 01:32:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109353956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:55,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:55,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:32:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849618227] [2022-12-13 01:32:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:55,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:32:55,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:32:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:32:55,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:32:55,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 2077 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:55,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:55,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:32:55,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:56,875 INFO L130 PetriNetUnfolder]: 4780/8518 cut-off events. [2022-12-13 01:32:56,876 INFO L131 PetriNetUnfolder]: For 92056/92056 co-relation queries the response was YES. [2022-12-13 01:32:56,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40711 conditions, 8518 events. 4780/8518 cut-off events. For 92056/92056 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 62796 event pairs, 3033 based on Foata normal form. 3/8516 useless extension candidates. Maximal degree in co-relation 40644. Up to 5955 conditions per place. [2022-12-13 01:32:56,921 INFO L137 encePairwiseOnDemand]: 44/57 looper letters, 157 selfloop transitions, 24 changer transitions 10/191 dead transitions. [2022-12-13 01:32:56,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 191 transitions, 2766 flow [2022-12-13 01:32:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-13 01:32:56,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2046783625730994 [2022-12-13 01:32:56,922 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 2077 flow. Second operand 9 states and 105 transitions. [2022-12-13 01:32:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 191 transitions, 2766 flow [2022-12-13 01:32:57,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 191 transitions, 2753 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:57,255 INFO L231 Difference]: Finished difference. Result has 150 places, 142 transitions, 2101 flow [2022-12-13 01:32:57,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2101, PETRI_PLACES=150, PETRI_TRANSITIONS=142} [2022-12-13 01:32:57,255 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2022-12-13 01:32:57,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:57,255 INFO L89 Accepts]: Start accepts. Operand has 150 places, 142 transitions, 2101 flow [2022-12-13 01:32:57,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:57,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:57,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 142 transitions, 2101 flow [2022-12-13 01:32:57,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 142 transitions, 2101 flow [2022-12-13 01:32:57,383 INFO L130 PetriNetUnfolder]: 182/1284 cut-off events. [2022-12-13 01:32:57,384 INFO L131 PetriNetUnfolder]: For 14501/14756 co-relation queries the response was YES. [2022-12-13 01:32:57,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5216 conditions, 1284 events. 182/1284 cut-off events. For 14501/14756 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13676 event pairs, 8 based on Foata normal form. 67/1318 useless extension candidates. Maximal degree in co-relation 5157. Up to 154 conditions per place. [2022-12-13 01:32:57,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 142 transitions, 2101 flow [2022-12-13 01:32:57,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 1188 [2022-12-13 01:32:57,396 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:32:57,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 01:32:57,397 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 142 transitions, 2101 flow [2022-12-13 01:32:57,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:32:57,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:32:57,397 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, 1] [2022-12-13 01:32:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 01:32:57,397 INFO L420 AbstractCegarLoop]: === Iteration 54 === 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 01:32:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:32:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash 947730936, now seen corresponding path program 2 times [2022-12-13 01:32:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:32:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040021772] [2022-12-13 01:32:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:32:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:32:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:32:57,867 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 01:32:57,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:32:57,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040021772] [2022-12-13 01:32:57,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040021772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:32:57,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:32:57,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:32:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891974095] [2022-12-13 01:32:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:32:57,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:32:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:32:57,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:32:57,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:32:57,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:32:57,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 142 transitions, 2101 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:32:57,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:32:57,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:32:57,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:32:59,207 INFO L130 PetriNetUnfolder]: 4777/8491 cut-off events. [2022-12-13 01:32:59,207 INFO L131 PetriNetUnfolder]: For 95577/95577 co-relation queries the response was YES. [2022-12-13 01:32:59,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40804 conditions, 8491 events. 4777/8491 cut-off events. For 95577/95577 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 62306 event pairs, 3441 based on Foata normal form. 3/8489 useless extension candidates. Maximal degree in co-relation 40737. Up to 8207 conditions per place. [2022-12-13 01:32:59,259 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 145 selfloop transitions, 15 changer transitions 17/177 dead transitions. [2022-12-13 01:32:59,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 177 transitions, 2726 flow [2022-12-13 01:32:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:32:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:32:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-12-13 01:32:59,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17348927875243664 [2022-12-13 01:32:59,260 INFO L175 Difference]: Start difference. First operand has 149 places, 142 transitions, 2101 flow. Second operand 9 states and 89 transitions. [2022-12-13 01:32:59,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 177 transitions, 2726 flow [2022-12-13 01:32:59,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 177 transitions, 2686 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 01:32:59,585 INFO L231 Difference]: Finished difference. Result has 154 places, 145 transitions, 2162 flow [2022-12-13 01:32:59,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2162, PETRI_PLACES=154, PETRI_TRANSITIONS=145} [2022-12-13 01:32:59,585 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2022-12-13 01:32:59,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:32:59,585 INFO L89 Accepts]: Start accepts. Operand has 154 places, 145 transitions, 2162 flow [2022-12-13 01:32:59,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:32:59,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:32:59,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 145 transitions, 2162 flow [2022-12-13 01:32:59,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 145 transitions, 2162 flow [2022-12-13 01:32:59,707 INFO L130 PetriNetUnfolder]: 185/1260 cut-off events. [2022-12-13 01:32:59,707 INFO L131 PetriNetUnfolder]: For 14523/14783 co-relation queries the response was YES. [2022-12-13 01:32:59,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5157 conditions, 1260 events. 185/1260 cut-off events. For 14523/14783 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13241 event pairs, 8 based on Foata normal form. 70/1297 useless extension candidates. Maximal degree in co-relation 5097. Up to 151 conditions per place. [2022-12-13 01:32:59,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 145 transitions, 2162 flow [2022-12-13 01:32:59,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 1186 [2022-12-13 01:32:59,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:32:59,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:33:00,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:00,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 562 [2022-12-13 01:33:00,147 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 2176 flow [2022-12-13 01:33:00,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:33:00,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:00,147 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, 1] [2022-12-13 01:33:00,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 01:33:00,147 INFO L420 AbstractCegarLoop]: === Iteration 55 === 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 01:33:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1667973230, now seen corresponding path program 6 times [2022-12-13 01:33:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892125972] [2022-12-13 01:33:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:00,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 01:33:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:00,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892125972] [2022-12-13 01:33:00,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892125972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:00,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:00,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:33:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131307572] [2022-12-13 01:33:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:00,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:33:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:33:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:33:00,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:33:00,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 2176 flow. Second operand has 6 states, 5 states have (on average 5.2) 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 01:33:00,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:00,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:33:00,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:01,599 INFO L130 PetriNetUnfolder]: 4769/8434 cut-off events. [2022-12-13 01:33:01,599 INFO L131 PetriNetUnfolder]: For 92855/92855 co-relation queries the response was YES. [2022-12-13 01:33:01,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40565 conditions, 8434 events. 4769/8434 cut-off events. For 92855/92855 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 61547 event pairs, 3074 based on Foata normal form. 3/8432 useless extension candidates. Maximal degree in co-relation 40497. Up to 7131 conditions per place. [2022-12-13 01:33:01,656 INFO L137 encePairwiseOnDemand]: 50/59 looper letters, 134 selfloop transitions, 30 changer transitions 17/181 dead transitions. [2022-12-13 01:33:01,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 181 transitions, 2734 flow [2022-12-13 01:33:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:33:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:33:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-13 01:33:01,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.268361581920904 [2022-12-13 01:33:01,657 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 2176 flow. Second operand 6 states and 95 transitions. [2022-12-13 01:33:01,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 181 transitions, 2734 flow [2022-12-13 01:33:02,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 181 transitions, 2682 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 01:33:02,126 INFO L231 Difference]: Finished difference. Result has 152 places, 139 transitions, 2086 flow [2022-12-13 01:33:02,126 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2086, PETRI_PLACES=152, PETRI_TRANSITIONS=139} [2022-12-13 01:33:02,127 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2022-12-13 01:33:02,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:02,127 INFO L89 Accepts]: Start accepts. Operand has 152 places, 139 transitions, 2086 flow [2022-12-13 01:33:02,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:02,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:02,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 139 transitions, 2086 flow [2022-12-13 01:33:02,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 2086 flow [2022-12-13 01:33:02,251 INFO L130 PetriNetUnfolder]: 184/1238 cut-off events. [2022-12-13 01:33:02,251 INFO L131 PetriNetUnfolder]: For 14739/14985 co-relation queries the response was YES. [2022-12-13 01:33:02,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5190 conditions, 1238 events. 184/1238 cut-off events. For 14739/14985 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12867 event pairs, 8 based on Foata normal form. 63/1267 useless extension candidates. Maximal degree in co-relation 5132. Up to 149 conditions per place. [2022-12-13 01:33:02,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 2086 flow [2022-12-13 01:33:02,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-13 01:33:02,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:33:02,479 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:33:02,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1903] $Ultimate##0-->L59-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~mem6#1_373| (select (select |v_#memory_int_1737| v_~get_2~0.base_548) (+ (* v_~id_0~0_659 4) v_~get_2~0.offset_458))) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_349| 256) 0) (= |v_#pthreadsForks_1318| (+ |v_#pthreadsForks_1319| 1)) (not |v_thread1Thread1of1ForFork1_#t~short5#1_591|) (= (store |v_#memory_int_1737| |v_ULTIMATE.start_main_~#t3~0#1.base_676| (store (select |v_#memory_int_1737| |v_ULTIMATE.start_main_~#t3~0#1.base_676|) |v_ULTIMATE.start_main_~#t3~0#1.offset_584| |v_ULTIMATE.start_main_#t~pre50#1_578|)) |v_#memory_int_1736|) (= (select (select |v_#memory_int_1737| v_~contains_key_1~0.base_519) (+ v_~id_0~0_659 v_~contains_key_1~0.offset_426)) |v_thread1Thread1of1ForFork1_#t~mem3#1_349|) (= v_~order2_14~0_254 |v_thread2Thread1of1ForFork2_#t~mem11#1_323|) (= v_~order1_13~0_250 (select (select |v_#memory_int_1737| v_~get_5~0.base_456) (+ v_~get_5~0.offset_445 (* v_~id_3~0_633 4)))) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_323| (select (select |v_#memory_int_1736| v_~get_8~0.base_488) (+ (* v_~id_6~0_554 4) v_~get_8~0.offset_432))) (= |v_#pthreadsForks_1319| |v_ULTIMATE.start_main_#t~pre50#1_578|)) InVars {~id_6~0=v_~id_6~0_554, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_584|, ~get_8~0.base=v_~get_8~0.base_488, ~get_8~0.offset=v_~get_8~0.offset_432, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_676|, ~contains_key_1~0.base=v_~contains_key_1~0.base_519, ~get_2~0.offset=v_~get_2~0.offset_458, #pthreadsForks=|v_#pthreadsForks_1319|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_426, ~get_5~0.base=v_~get_5~0.base_456, #memory_int=|v_#memory_int_1737|, ~get_2~0.base=v_~get_2~0.base_548, ~id_3~0=v_~id_3~0_633, ~id_0~0=v_~id_0~0_659, ~get_5~0.offset=v_~get_5~0.offset_445} OutVars{~id_6~0=v_~id_6~0_554, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_683|, ~order1_13~0=v_~order1_13~0_250, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_373|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_584|, ~get_8~0.base=v_~get_8~0.base_488, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_676|, ~contains_key_1~0.base=v_~contains_key_1~0.base_519, #pthreadsForks=|v_#pthreadsForks_1318|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_578|, ~get_2~0.base=v_~get_2~0.base_548, ~id_3~0=v_~id_3~0_633, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_429|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_591|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_349|, ~order2_14~0=v_~order2_14~0_254, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_323|, ~get_8~0.offset=v_~get_8~0.offset_432, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_558|, ~get_2~0.offset=v_~get_2~0.offset_458, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_426, ~get_5~0.base=v_~get_5~0.base_456, #memory_int=|v_#memory_int_1736|, ~id_0~0=v_~id_0~0_659, ~get_5~0.offset=v_~get_5~0.offset_445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, ~order2_14~0] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:33:02,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1941] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (+ v_~get_5~0.offset_573 (* v_~id_3~0_794 4)))) (and (= |v_thread2Thread1of1ForFork2_#t~mem11#1_391| (select (select |v_#memory_int_2043| v_~get_8~0.base_598) (+ (* v_~id_6~0_675 4) v_~get_8~0.offset_540))) (= (store |v_#memory_int_2044| |v_ULTIMATE.start_main_~#t3~0#1.base_819| (store (select |v_#memory_int_2044| |v_ULTIMATE.start_main_~#t3~0#1.base_819|) |v_ULTIMATE.start_main_~#t3~0#1.offset_712| |v_ULTIMATE.start_main_#t~pre50#1_706|)) |v_#memory_int_2043|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_224| (select (select |v_#memory_int_2043| v_~get_2~0.base_624) (+ (* v_~id_0~0_720 4) v_~get_2~0.offset_511))) (= |v_thread1Thread1of1ForFork1_minus_~b#1_248| |v_thread1Thread1of1ForFork1_minus_#in~b#1_222|) (<= 0 (+ v_~result_9~0_276 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_208| 0) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_248| |v_thread1Thread1of1ForFork1_minus_#res#1_242|) |v_thread1Thread1of1ForFork1_minus_~a#1_248|) (= |v_#pthreadsForks_1575| |v_ULTIMATE.start_main_#t~pre50#1_706|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_224| |v_thread1Thread1of1ForFork1_minus_~a#1_248|) (<= v_~result_9~0_276 2147483647) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_248|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_248| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_248| 2147483647))) 1 0)) (= (mod (select (select |v_#memory_int_2044| v_~contains_key_1~0.base_581) (+ v_~id_0~0_720 v_~contains_key_1~0.offset_464)) 256) 0) (= v_~result_9~0_276 |v_thread1Thread1of1ForFork1_minus_#res#1_242|) (= v_~order1_13~0_338 (select (select |v_#memory_int_2044| v_~get_5~0.base_584) .cse0)) (= (select (select |v_#memory_int_2043| v_~get_5~0.base_584) .cse0) |v_thread1Thread1of1ForFork1_minus_#in~b#1_222|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_208| 0) (= v_~order2_14~0_342 |v_thread2Thread1of1ForFork2_#t~mem11#1_391|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_685|) (= (+ |v_#pthreadsForks_1575| 1) |v_#pthreadsForks_1574|))) InVars {~id_6~0=v_~id_6~0_675, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_712|, ~get_8~0.base=v_~get_8~0.base_598, ~get_8~0.offset=v_~get_8~0.offset_540, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_819|, ~contains_key_1~0.base=v_~contains_key_1~0.base_581, ~get_2~0.offset=v_~get_2~0.offset_511, #pthreadsForks=|v_#pthreadsForks_1575|, ~get_5~0.base=v_~get_5~0.base_584, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_464, ~id_3~0=v_~id_3~0_794, #memory_int=|v_#memory_int_2044|, ~get_2~0.base=v_~get_2~0.base_624, ~id_0~0=v_~id_0~0_720, ~get_5~0.offset=v_~get_5~0.offset_573} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_224|, ~id_6~0=v_~id_6~0_675, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_811|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_411|, ~order1_13~0=v_~order1_13~0_338, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_712|, ~get_8~0.base=v_~get_8~0.base_598, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_819|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_236|, ~result_9~0=v_~result_9~0_276, ~contains_key_1~0.base=v_~contains_key_1~0.base_581, #pthreadsForks=|v_#pthreadsForks_1574|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_234|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_706|, ~id_3~0=v_~id_3~0_794, ~get_2~0.base=v_~get_2~0.base_624, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_485|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_387|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_684|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_208|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_240|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_208|, ~order2_14~0=v_~order2_14~0_342, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_273|, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_391|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_242|, ~get_8~0.offset=v_~get_8~0.offset_540, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_686|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_222|, ~get_2~0.offset=v_~get_2~0.offset_511, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_248|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258|, ~get_5~0.base=v_~get_5~0.base_584, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_464, #memory_int=|v_#memory_int_2043|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_248|, ~id_0~0=v_~id_0~0_720, ~get_5~0.offset=v_~get_5~0.offset_573} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_685|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem6#1, ~order1_13~0, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem7#1, ULTIMATE.start_main_#t~pre50#1, thread2Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_#res#1.base, ~order2_14~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork2_#t~mem11#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_main_#t~nondet49#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, thread1Thread1of1ForFork1_minus_~a#1] and [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:33:03,085 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:33:03,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 959 [2022-12-13 01:33:03,086 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 2176 flow [2022-12-13 01:33:03,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) 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 01:33:03,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:03,086 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 01:33:03,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 01:33:03,086 INFO L420 AbstractCegarLoop]: === Iteration 56 === 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 01:33:03,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1677612982, now seen corresponding path program 1 times [2022-12-13 01:33:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:03,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125955079] [2022-12-13 01:33:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:03,527 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 01:33:03,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:03,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125955079] [2022-12-13 01:33:03,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125955079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:03,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:03,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:33:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977631202] [2022-12-13 01:33:03,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:03,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:33:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:33:03,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:33:03,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 01:33:03,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 139 transitions, 2176 flow. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:33:03,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:03,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 01:33:03,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:04,768 INFO L130 PetriNetUnfolder]: 4730/8360 cut-off events. [2022-12-13 01:33:04,769 INFO L131 PetriNetUnfolder]: For 97054/97054 co-relation queries the response was YES. [2022-12-13 01:33:04,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40912 conditions, 8360 events. 4730/8360 cut-off events. For 97054/97054 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 60767 event pairs, 3419 based on Foata normal form. 3/8357 useless extension candidates. Maximal degree in co-relation 40846. Up to 8139 conditions per place. [2022-12-13 01:33:04,820 INFO L137 encePairwiseOnDemand]: 51/62 looper letters, 135 selfloop transitions, 14 changer transitions 9/158 dead transitions. [2022-12-13 01:33:04,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 158 transitions, 2516 flow [2022-12-13 01:33:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-13 01:33:04,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16733870967741934 [2022-12-13 01:33:04,821 INFO L175 Difference]: Start difference. First operand has 149 places, 139 transitions, 2176 flow. Second operand 8 states and 83 transitions. [2022-12-13 01:33:04,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 158 transitions, 2516 flow [2022-12-13 01:33:05,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 158 transitions, 2410 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-13 01:33:05,227 INFO L231 Difference]: Finished difference. Result has 150 places, 136 transitions, 1974 flow [2022-12-13 01:33:05,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1974, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2022-12-13 01:33:05,227 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2022-12-13 01:33:05,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:05,227 INFO L89 Accepts]: Start accepts. Operand has 150 places, 136 transitions, 1974 flow [2022-12-13 01:33:05,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:05,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:05,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 136 transitions, 1974 flow [2022-12-13 01:33:05,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 136 transitions, 1974 flow [2022-12-13 01:33:05,345 INFO L130 PetriNetUnfolder]: 181/1233 cut-off events. [2022-12-13 01:33:05,346 INFO L131 PetriNetUnfolder]: For 12366/12612 co-relation queries the response was YES. [2022-12-13 01:33:05,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4933 conditions, 1233 events. 181/1233 cut-off events. For 12366/12612 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12871 event pairs, 8 based on Foata normal form. 63/1263 useless extension candidates. Maximal degree in co-relation 4876. Up to 149 conditions per place. [2022-12-13 01:33:05,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 136 transitions, 1974 flow [2022-12-13 01:33:05,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 1164 [2022-12-13 01:33:05,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:33:05,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] [2022-12-13 01:33:06,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:06,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1183 [2022-12-13 01:33:06,410 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 135 transitions, 1976 flow [2022-12-13 01:33:06,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:33:06,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:06,411 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, 1] [2022-12-13 01:33:06,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 01:33:06,411 INFO L420 AbstractCegarLoop]: === Iteration 57 === 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 01:33:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash 170230068, now seen corresponding path program 4 times [2022-12-13 01:33:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33034460] [2022-12-13 01:33:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:06,794 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 01:33:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:06,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33034460] [2022-12-13 01:33:06,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33034460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:06,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:06,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:33:06,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21264345] [2022-12-13 01:33:06,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:06,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:33:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:33:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:33:06,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 01:33:06,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 135 transitions, 1976 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:33:06,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:06,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 01:33:06,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:08,041 INFO L130 PetriNetUnfolder]: 4724/8326 cut-off events. [2022-12-13 01:33:08,041 INFO L131 PetriNetUnfolder]: For 83593/83593 co-relation queries the response was YES. [2022-12-13 01:33:08,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39596 conditions, 8326 events. 4724/8326 cut-off events. For 83593/83593 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 60259 event pairs, 3415 based on Foata normal form. 1/8322 useless extension candidates. Maximal degree in co-relation 39531. Up to 8024 conditions per place. [2022-12-13 01:33:08,102 INFO L137 encePairwiseOnDemand]: 52/61 looper letters, 143 selfloop transitions, 6 changer transitions 19/168 dead transitions. [2022-12-13 01:33:08,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 168 transitions, 2430 flow [2022-12-13 01:33:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-13 01:33:08,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20491803278688525 [2022-12-13 01:33:08,103 INFO L175 Difference]: Start difference. First operand has 147 places, 135 transitions, 1976 flow. Second operand 8 states and 100 transitions. [2022-12-13 01:33:08,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 168 transitions, 2430 flow [2022-12-13 01:33:08,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 168 transitions, 2387 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 01:33:08,552 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 1857 flow [2022-12-13 01:33:08,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1857, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2022-12-13 01:33:08,552 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2022-12-13 01:33:08,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:08,552 INFO L89 Accepts]: Start accepts. Operand has 149 places, 131 transitions, 1857 flow [2022-12-13 01:33:08,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:08,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:08,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 131 transitions, 1857 flow [2022-12-13 01:33:08,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 131 transitions, 1857 flow [2022-12-13 01:33:08,669 INFO L130 PetriNetUnfolder]: 181/1213 cut-off events. [2022-12-13 01:33:08,669 INFO L131 PetriNetUnfolder]: For 11886/12130 co-relation queries the response was YES. [2022-12-13 01:33:08,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4800 conditions, 1213 events. 181/1213 cut-off events. For 11886/12130 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12558 event pairs, 8 based on Foata normal form. 63/1243 useless extension candidates. Maximal degree in co-relation 4743. Up to 147 conditions per place. [2022-12-13 01:33:08,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 131 transitions, 1857 flow [2022-12-13 01:33:08,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-13 01:33:08,680 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:08,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:33:08,681 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 131 transitions, 1857 flow [2022-12-13 01:33:08,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:33:08,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:08,681 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 01:33:08,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 01:33:08,681 INFO L420 AbstractCegarLoop]: === Iteration 58 === 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 01:33:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2109040648, now seen corresponding path program 1 times [2022-12-13 01:33:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:08,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762588765] [2022-12-13 01:33:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:08,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:09,187 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 01:33:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:09,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762588765] [2022-12-13 01:33:09,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762588765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:09,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:09,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:33:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885466882] [2022-12-13 01:33:09,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:09,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:33:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:09,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:33:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:33:09,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 01:33:09,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 1857 flow. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:33:09,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:09,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 01:33:09,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:10,420 INFO L130 PetriNetUnfolder]: 4686/8237 cut-off events. [2022-12-13 01:33:10,420 INFO L131 PetriNetUnfolder]: For 81914/81914 co-relation queries the response was YES. [2022-12-13 01:33:10,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38983 conditions, 8237 events. 4686/8237 cut-off events. For 81914/81914 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 59311 event pairs, 3378 based on Foata normal form. 3/8235 useless extension candidates. Maximal degree in co-relation 38918. Up to 8025 conditions per place. [2022-12-13 01:33:10,468 INFO L137 encePairwiseOnDemand]: 51/60 looper letters, 127 selfloop transitions, 9 changer transitions 16/152 dead transitions. [2022-12-13 01:33:10,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 152 transitions, 2271 flow [2022-12-13 01:33:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 01:33:10,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16875 [2022-12-13 01:33:10,469 INFO L175 Difference]: Start difference. First operand has 143 places, 131 transitions, 1857 flow. Second operand 8 states and 81 transitions. [2022-12-13 01:33:10,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 152 transitions, 2271 flow [2022-12-13 01:33:10,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 152 transitions, 2252 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-13 01:33:10,754 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 1756 flow [2022-12-13 01:33:10,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1756, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2022-12-13 01:33:10,754 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2022-12-13 01:33:10,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:10,754 INFO L89 Accepts]: Start accepts. Operand has 144 places, 127 transitions, 1756 flow [2022-12-13 01:33:10,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:10,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:10,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 127 transitions, 1756 flow [2022-12-13 01:33:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 127 transitions, 1756 flow [2022-12-13 01:33:10,864 INFO L130 PetriNetUnfolder]: 178/1183 cut-off events. [2022-12-13 01:33:10,865 INFO L131 PetriNetUnfolder]: For 11494/11734 co-relation queries the response was YES. [2022-12-13 01:33:10,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 1183 events. 178/1183 cut-off events. For 11494/11734 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12154 event pairs, 8 based on Foata normal form. 63/1213 useless extension candidates. Maximal degree in co-relation 4612. Up to 144 conditions per place. [2022-12-13 01:33:10,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 127 transitions, 1756 flow [2022-12-13 01:33:10,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 1128 [2022-12-13 01:33:10,875 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:10,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:33:10,876 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 127 transitions, 1756 flow [2022-12-13 01:33:10,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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 01:33:10,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:10,876 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, 1] [2022-12-13 01:33:10,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 01:33:10,876 INFO L420 AbstractCegarLoop]: === Iteration 59 === 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 01:33:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2100524930, now seen corresponding path program 2 times [2022-12-13 01:33:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:10,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363141743] [2022-12-13 01:33:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:11,264 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 01:33:11,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:11,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363141743] [2022-12-13 01:33:11,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363141743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:33:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297500426] [2022-12-13 01:33:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:11,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:33:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:33:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:33:11,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 01:33:11,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 127 transitions, 1756 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:11,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:11,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 01:33:11,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:12,439 INFO L130 PetriNetUnfolder]: 4665/8179 cut-off events. [2022-12-13 01:33:12,440 INFO L131 PetriNetUnfolder]: For 80418/80418 co-relation queries the response was YES. [2022-12-13 01:33:12,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38655 conditions, 8179 events. 4665/8179 cut-off events. For 80418/80418 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 58584 event pairs, 3425 based on Foata normal form. 1/8175 useless extension candidates. Maximal degree in co-relation 38592. Up to 8105 conditions per place. [2022-12-13 01:33:12,517 INFO L137 encePairwiseOnDemand]: 52/58 looper letters, 134 selfloop transitions, 4 changer transitions 14/152 dead transitions. [2022-12-13 01:33:12,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 152 transitions, 2188 flow [2022-12-13 01:33:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:33:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:33:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-13 01:33:12,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21182266009852216 [2022-12-13 01:33:12,519 INFO L175 Difference]: Start difference. First operand has 139 places, 127 transitions, 1756 flow. Second operand 7 states and 86 transitions. [2022-12-13 01:33:12,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 152 transitions, 2188 flow [2022-12-13 01:33:12,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 2154 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 01:33:12,825 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 1706 flow [2022-12-13 01:33:12,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1706, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2022-12-13 01:33:12,825 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2022-12-13 01:33:12,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:12,826 INFO L89 Accepts]: Start accepts. Operand has 141 places, 125 transitions, 1706 flow [2022-12-13 01:33:12,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:12,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:12,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 125 transitions, 1706 flow [2022-12-13 01:33:12,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 125 transitions, 1706 flow [2022-12-13 01:33:12,938 INFO L130 PetriNetUnfolder]: 178/1168 cut-off events. [2022-12-13 01:33:12,938 INFO L131 PetriNetUnfolder]: For 11281/11521 co-relation queries the response was YES. [2022-12-13 01:33:12,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4588 conditions, 1168 events. 178/1168 cut-off events. For 11281/11521 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11908 event pairs, 8 based on Foata normal form. 63/1197 useless extension candidates. Maximal degree in co-relation 4534. Up to 142 conditions per place. [2022-12-13 01:33:12,947 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 125 transitions, 1706 flow [2022-12-13 01:33:12,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-13 01:33:12,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:33:13,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:13,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 674 [2022-12-13 01:33:13,500 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 126 transitions, 1737 flow [2022-12-13 01:33:13,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:13,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:13,501 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, 1] [2022-12-13 01:33:13,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 01:33:13,501 INFO L420 AbstractCegarLoop]: === Iteration 60 === 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 01:33:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1953239876, now seen corresponding path program 3 times [2022-12-13 01:33:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:13,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942367722] [2022-12-13 01:33:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:13,994 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 01:33:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:13,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942367722] [2022-12-13 01:33:13,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942367722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:13,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:13,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:33:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007971579] [2022-12-13 01:33:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:13,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:33:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:13,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:33:13,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:33:13,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 01:33:13,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 126 transitions, 1737 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:33:13,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:13,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 01:33:13,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:15,263 INFO L130 PetriNetUnfolder]: 4595/8042 cut-off events. [2022-12-13 01:33:15,263 INFO L131 PetriNetUnfolder]: For 78193/78193 co-relation queries the response was YES. [2022-12-13 01:33:15,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37820 conditions, 8042 events. 4595/8042 cut-off events. For 78193/78193 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 57237 event pairs, 3380 based on Foata normal form. 1/8037 useless extension candidates. Maximal degree in co-relation 37758. Up to 7984 conditions per place. [2022-12-13 01:33:15,304 INFO L137 encePairwiseOnDemand]: 52/59 looper letters, 119 selfloop transitions, 2 changer transitions 19/140 dead transitions. [2022-12-13 01:33:15,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 140 transitions, 2039 flow [2022-12-13 01:33:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-13 01:33:15,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.163135593220339 [2022-12-13 01:33:15,305 INFO L175 Difference]: Start difference. First operand has 141 places, 126 transitions, 1737 flow. Second operand 8 states and 77 transitions. [2022-12-13 01:33:15,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 140 transitions, 2039 flow [2022-12-13 01:33:15,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 2025 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 01:33:15,563 INFO L231 Difference]: Finished difference. Result has 143 places, 121 transitions, 1610 flow [2022-12-13 01:33:15,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1610, PETRI_PLACES=143, PETRI_TRANSITIONS=121} [2022-12-13 01:33:15,563 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2022-12-13 01:33:15,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:15,563 INFO L89 Accepts]: Start accepts. Operand has 143 places, 121 transitions, 1610 flow [2022-12-13 01:33:15,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:15,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:15,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 121 transitions, 1610 flow [2022-12-13 01:33:15,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 1610 flow [2022-12-13 01:33:15,674 INFO L130 PetriNetUnfolder]: 178/1152 cut-off events. [2022-12-13 01:33:15,674 INFO L131 PetriNetUnfolder]: For 10908/11147 co-relation queries the response was YES. [2022-12-13 01:33:15,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4511 conditions, 1152 events. 178/1152 cut-off events. For 10908/11147 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11699 event pairs, 8 based on Foata normal form. 63/1182 useless extension candidates. Maximal degree in co-relation 4457. Up to 140 conditions per place. [2022-12-13 01:33:15,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 1610 flow [2022-12-13 01:33:15,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 1082 [2022-12-13 01:33:15,685 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:15,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:33:15,686 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 1610 flow [2022-12-13 01:33:15,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:33:15,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:15,686 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, 1] [2022-12-13 01:33:15,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 01:33:15,686 INFO L420 AbstractCegarLoop]: === Iteration 61 === 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 01:33:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1262970505, now seen corresponding path program 1 times [2022-12-13 01:33:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310590503] [2022-12-13 01:33:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:16,175 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 01:33:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:16,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310590503] [2022-12-13 01:33:16,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310590503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:16,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:16,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:33:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77883904] [2022-12-13 01:33:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:16,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:33:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:16,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:33:16,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:33:16,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:33:16,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 1610 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:33:16,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:16,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:33:16,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:17,586 INFO L130 PetriNetUnfolder]: 4749/8348 cut-off events. [2022-12-13 01:33:17,586 INFO L131 PetriNetUnfolder]: For 81189/81189 co-relation queries the response was YES. [2022-12-13 01:33:17,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39172 conditions, 8348 events. 4749/8348 cut-off events. For 81189/81189 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 60321 event pairs, 3016 based on Foata normal form. 2/8345 useless extension candidates. Maximal degree in co-relation 39110. Up to 6800 conditions per place. [2022-12-13 01:33:17,638 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 142 selfloop transitions, 18 changer transitions 13/173 dead transitions. [2022-12-13 01:33:17,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 173 transitions, 2300 flow [2022-12-13 01:33:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:33:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:33:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-13 01:33:17,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2556390977443609 [2022-12-13 01:33:17,639 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 1610 flow. Second operand 7 states and 102 transitions. [2022-12-13 01:33:17,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 173 transitions, 2300 flow [2022-12-13 01:33:17,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 173 transitions, 2273 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 01:33:17,955 INFO L231 Difference]: Finished difference. Result has 133 places, 123 transitions, 1699 flow [2022-12-13 01:33:17,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1699, PETRI_PLACES=133, PETRI_TRANSITIONS=123} [2022-12-13 01:33:17,956 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2022-12-13 01:33:17,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:17,956 INFO L89 Accepts]: Start accepts. Operand has 133 places, 123 transitions, 1699 flow [2022-12-13 01:33:17,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:17,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:17,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 123 transitions, 1699 flow [2022-12-13 01:33:17,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 1699 flow [2022-12-13 01:33:18,072 INFO L130 PetriNetUnfolder]: 181/1201 cut-off events. [2022-12-13 01:33:18,073 INFO L131 PetriNetUnfolder]: For 12492/12741 co-relation queries the response was YES. [2022-12-13 01:33:18,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 1201 events. 181/1201 cut-off events. For 12492/12741 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12417 event pairs, 10 based on Foata normal form. 66/1232 useless extension candidates. Maximal degree in co-relation 4680. Up to 143 conditions per place. [2022-12-13 01:33:18,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 1699 flow [2022-12-13 01:33:18,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-13 01:33:18,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1895] $Ultimate##0-->L103-3: Formula: (and (= |v_#pthreadsForks_1269| |v_ULTIMATE.start_main_#t~pre50#1_553|) (= |v_#memory_int_1683| (store |v_#memory_int_1684| |v_ULTIMATE.start_main_~#t3~0#1.base_648| (store (select |v_#memory_int_1684| |v_ULTIMATE.start_main_~#t3~0#1.base_648|) |v_ULTIMATE.start_main_~#t3~0#1.offset_559| |v_ULTIMATE.start_main_#t~pre50#1_553|))) (= |v_thread2Thread1of1ForFork2_#t~mem10#1_409| (select (select |v_#memory_int_1684| v_~get_5~0.base_432) (+ v_~get_5~0.offset_421 (* v_~id_3~0_607 4)))) (= |v_#pthreadsForks_1268| (+ |v_#pthreadsForks_1269| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_1269|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_559|, ~get_5~0.base=v_~get_5~0.base_432, #memory_int=|v_#memory_int_1684|, ~id_3~0=v_~id_3~0_607, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_648|, ~get_5~0.offset=v_~get_5~0.offset_421} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_658|, #pthreadsForks=|v_#pthreadsForks_1268|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_559|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_553|, ~get_5~0.base=v_~get_5~0.base_432, #memory_int=|v_#memory_int_1683|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_533|, ~id_3~0=v_~id_3~0_607, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_648|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_409|, ~get_5~0.offset=v_~get_5~0.offset_421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1, thread2Thread1of1ForFork2_#t~mem10#1] and [1566] L58-->L59-2: Formula: (and (= |v_thread2Thread1of1ForFork2_#t~mem10#1_28| v_~order1_13~0_25) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| v_~order2_14~0_19) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_15| (select (select |v_#memory_int_180| v_~get_8~0.base_41) (+ (* 4 v_~id_6~0_57) v_~get_8~0.offset_41)))) InVars {~id_6~0=v_~id_6~0_57, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_28|} OutVars{~id_6~0=v_~id_6~0_57, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_15|, ~order1_13~0=v_~order1_13~0_25, ~get_8~0.base=v_~get_8~0.base_41, ~get_8~0.offset=v_~get_8~0.offset_41, #memory_int=|v_#memory_int_180|, ~order2_14~0=v_~order2_14~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:33:18,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:18,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 01:33:18,120 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 122 transitions, 1697 flow [2022-12-13 01:33:18,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:33:18,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:18,121 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, 1] [2022-12-13 01:33:18,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 01:33:18,121 INFO L420 AbstractCegarLoop]: === Iteration 62 === 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 01:33:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1689284831, now seen corresponding path program 2 times [2022-12-13 01:33:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:18,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921355428] [2022-12-13 01:33:18,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:18,709 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 01:33:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:18,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921355428] [2022-12-13 01:33:18,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921355428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:18,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:18,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:33:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630606172] [2022-12-13 01:33:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:18,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:33:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:33:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:33:18,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:33:18,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 122 transitions, 1697 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:18,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:18,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:33:18,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:19,972 INFO L130 PetriNetUnfolder]: 4508/7946 cut-off events. [2022-12-13 01:33:19,972 INFO L131 PetriNetUnfolder]: For 88643/88643 co-relation queries the response was YES. [2022-12-13 01:33:20,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38529 conditions, 7946 events. 4508/7946 cut-off events. For 88643/88643 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 56985 event pairs, 3362 based on Foata normal form. 2/7942 useless extension candidates. Maximal degree in co-relation 38467. Up to 7645 conditions per place. [2022-12-13 01:33:20,023 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 137 selfloop transitions, 3 changer transitions 18/158 dead transitions. [2022-12-13 01:33:20,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 158 transitions, 2217 flow [2022-12-13 01:33:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-12-13 01:33:20,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20089285714285715 [2022-12-13 01:33:20,028 INFO L175 Difference]: Start difference. First operand has 130 places, 122 transitions, 1697 flow. Second operand 8 states and 90 transitions. [2022-12-13 01:33:20,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 158 transitions, 2217 flow [2022-12-13 01:33:20,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 158 transitions, 2194 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 01:33:20,395 INFO L231 Difference]: Finished difference. Result has 136 places, 121 transitions, 1671 flow [2022-12-13 01:33:20,395 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1671, PETRI_PLACES=136, PETRI_TRANSITIONS=121} [2022-12-13 01:33:20,395 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2022-12-13 01:33:20,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:20,395 INFO L89 Accepts]: Start accepts. Operand has 136 places, 121 transitions, 1671 flow [2022-12-13 01:33:20,396 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:20,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:20,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 121 transitions, 1671 flow [2022-12-13 01:33:20,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 121 transitions, 1671 flow [2022-12-13 01:33:20,503 INFO L130 PetriNetUnfolder]: 171/1164 cut-off events. [2022-12-13 01:33:20,503 INFO L131 PetriNetUnfolder]: For 11264/11478 co-relation queries the response was YES. [2022-12-13 01:33:20,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4548 conditions, 1164 events. 171/1164 cut-off events. For 11264/11478 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11948 event pairs, 8 based on Foata normal form. 67/1198 useless extension candidates. Maximal degree in co-relation 4492. Up to 132 conditions per place. [2022-12-13 01:33:20,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 121 transitions, 1671 flow [2022-12-13 01:33:20,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-13 01:33:20,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:20,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:33:20,514 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 1671 flow [2022-12-13 01:33:20,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:20,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:20,515 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 01:33:20,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 01:33:20,515 INFO L420 AbstractCegarLoop]: === Iteration 63 === 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 01:33:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1975438023, now seen corresponding path program 1 times [2022-12-13 01:33:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:20,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437908801] [2022-12-13 01:33:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:21,179 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 01:33:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437908801] [2022-12-13 01:33:21,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437908801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:21,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:21,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:33:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364212119] [2022-12-13 01:33:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:21,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:33:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:21,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:33:21,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:33:21,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:33:21,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 1671 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:21,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:21,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:33:21,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:22,523 INFO L130 PetriNetUnfolder]: 4524/7987 cut-off events. [2022-12-13 01:33:22,524 INFO L131 PetriNetUnfolder]: For 88718/88718 co-relation queries the response was YES. [2022-12-13 01:33:22,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38742 conditions, 7987 events. 4524/7987 cut-off events. For 88718/88718 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 57463 event pairs, 3398 based on Foata normal form. 1/7983 useless extension candidates. Maximal degree in co-relation 38678. Up to 7868 conditions per place. [2022-12-13 01:33:22,581 INFO L137 encePairwiseOnDemand]: 47/56 looper letters, 135 selfloop transitions, 8 changer transitions 12/155 dead transitions. [2022-12-13 01:33:22,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 155 transitions, 2166 flow [2022-12-13 01:33:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:33:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:33:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-12-13 01:33:22,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16071428571428573 [2022-12-13 01:33:22,582 INFO L175 Difference]: Start difference. First operand has 133 places, 121 transitions, 1671 flow. Second operand 10 states and 90 transitions. [2022-12-13 01:33:22,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 155 transitions, 2166 flow [2022-12-13 01:33:22,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 155 transitions, 2147 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 01:33:22,964 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 1763 flow [2022-12-13 01:33:22,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1763, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2022-12-13 01:33:22,964 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2022-12-13 01:33:22,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:22,964 INFO L89 Accepts]: Start accepts. Operand has 142 places, 126 transitions, 1763 flow [2022-12-13 01:33:22,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:22,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:22,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 126 transitions, 1763 flow [2022-12-13 01:33:22,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 126 transitions, 1763 flow [2022-12-13 01:33:23,100 INFO L130 PetriNetUnfolder]: 170/1173 cut-off events. [2022-12-13 01:33:23,100 INFO L131 PetriNetUnfolder]: For 11599/11816 co-relation queries the response was YES. [2022-12-13 01:33:23,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4633 conditions, 1173 events. 170/1173 cut-off events. For 11599/11816 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12084 event pairs, 8 based on Foata normal form. 69/1209 useless extension candidates. Maximal degree in co-relation 4574. Up to 134 conditions per place. [2022-12-13 01:33:23,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 126 transitions, 1763 flow [2022-12-13 01:33:23,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-13 01:33:23,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1890] L52-->L102-3: Formula: (and (= |v_#pthreadsForks_1048| (+ |v_#pthreadsForks_1049| 1)) (= (select (select |v_#memory_int_1456| v_~get_2~0.base_447) (+ (* v_~id_0~0_553 4) v_~get_2~0.offset_402)) |v_thread1Thread1of1ForFork1_minus_#in~a#1_174|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_198| |v_thread1Thread1of1ForFork1_minus_#in~b#1_172|) (= (select (select |v_#memory_int_1456| v_~get_5~0.base_382) (+ v_~get_5~0.offset_371 (* v_~id_3~0_537 4))) |v_thread1Thread1of1ForFork1_minus_#in~b#1_172|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_198| |v_thread1Thread1of1ForFork1_minus_#res#1_192|) |v_thread1Thread1of1ForFork1_minus_~a#1_198|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_158| 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_459|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_174| |v_thread1Thread1of1ForFork1_minus_~a#1_198|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_198|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_198| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_198| 2147483647))) 1 0)) (<= v_~result_9~0_226 2147483647) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|) (<= 0 (+ v_~result_9~0_226 2147483648)) (= |v_#memory_int_1455| (store |v_#memory_int_1456| |v_ULTIMATE.start_main_~#t2~0#1.base_142| (store (select |v_#memory_int_1456| |v_ULTIMATE.start_main_~#t2~0#1.base_142|) |v_ULTIMATE.start_main_~#t2~0#1.offset_142| |v_ULTIMATE.start_main_#t~pre48#1_548|))) (= |v_#pthreadsForks_1049| |v_ULTIMATE.start_main_#t~pre48#1_548|) (= v_~result_9~0_226 |v_thread1Thread1of1ForFork1_minus_#res#1_192|) (= 0 (mod (select (select |v_#memory_int_1456| v_~contains_key_1~0.base_381) (+ v_~id_0~0_553 v_~contains_key_1~0.offset_328)) 256)) (= |v_thread1Thread1of1ForFork1_#res#1.base_158| 0)) InVars {~get_2~0.offset=v_~get_2~0.offset_402, #pthreadsForks=|v_#pthreadsForks_1049|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, ~get_5~0.base=v_~get_5~0.base_382, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_328, ~id_3~0=v_~id_3~0_537, ~get_2~0.base=v_~get_2~0.base_447, #memory_int=|v_#memory_int_1456|, ~id_0~0=v_~id_0~0_553, ~get_5~0.offset=v_~get_5~0.offset_371, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_142|, ~contains_key_1~0.base=v_~contains_key_1~0.base_381} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_174|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_548|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_321|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_114|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_186|, ~result_9~0=v_~result_9~0_226, ~contains_key_1~0.base=v_~contains_key_1~0.base_381, #pthreadsForks=|v_#pthreadsForks_1048|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_184|, ~id_3~0=v_~id_3~0_537, ~get_2~0.base=v_~get_2~0.base_447, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_128|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_245|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_458|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_158|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_190|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_158|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_193|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_192|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_172|, ~get_2~0.offset=v_~get_2~0.offset_402, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_198|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, ~get_5~0.base=v_~get_5~0.base_382, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_328, #memory_int=|v_#memory_int_1455|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_198|, ~id_0~0=v_~id_0~0_553, ~get_5~0.offset=v_~get_5~0.offset_371, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_142|} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_459|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~nondet47#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre46#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:33:23,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:23,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 341 [2022-12-13 01:33:23,305 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 127 transitions, 1798 flow [2022-12-13 01:33:23,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:23,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:23,306 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 01:33:23,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 01:33:23,306 INFO L420 AbstractCegarLoop]: === Iteration 64 === 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 01:33:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1230613951, now seen corresponding path program 2 times [2022-12-13 01:33:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:23,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130749864] [2022-12-13 01:33:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:23,963 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 01:33:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:23,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130749864] [2022-12-13 01:33:23,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130749864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:23,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:23,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:33:23,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397178471] [2022-12-13 01:33:23,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:23,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:33:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:33:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:33:23,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:33:23,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 127 transitions, 1798 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:23,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:23,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:33:23,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:25,369 INFO L130 PetriNetUnfolder]: 4515/7962 cut-off events. [2022-12-13 01:33:25,370 INFO L131 PetriNetUnfolder]: For 91015/91015 co-relation queries the response was YES. [2022-12-13 01:33:25,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39037 conditions, 7962 events. 4515/7962 cut-off events. For 91015/91015 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 57167 event pairs, 3374 based on Foata normal form. 1/7958 useless extension candidates. Maximal degree in co-relation 38970. Up to 7868 conditions per place. [2022-12-13 01:33:25,415 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 121 selfloop transitions, 6 changer transitions 23/150 dead transitions. [2022-12-13 01:33:25,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 150 transitions, 2143 flow [2022-12-13 01:33:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:33:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:33:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-12-13 01:33:25,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16764132553606237 [2022-12-13 01:33:25,416 INFO L175 Difference]: Start difference. First operand has 141 places, 127 transitions, 1798 flow. Second operand 9 states and 86 transitions. [2022-12-13 01:33:25,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 150 transitions, 2143 flow [2022-12-13 01:33:25,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 150 transitions, 2095 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-13 01:33:25,750 INFO L231 Difference]: Finished difference. Result has 147 places, 124 transitions, 1715 flow [2022-12-13 01:33:25,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1715, PETRI_PLACES=147, PETRI_TRANSITIONS=124} [2022-12-13 01:33:25,751 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2022-12-13 01:33:25,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:25,751 INFO L89 Accepts]: Start accepts. Operand has 147 places, 124 transitions, 1715 flow [2022-12-13 01:33:25,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:25,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:25,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 124 transitions, 1715 flow [2022-12-13 01:33:25,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 124 transitions, 1715 flow [2022-12-13 01:33:25,876 INFO L130 PetriNetUnfolder]: 170/1159 cut-off events. [2022-12-13 01:33:25,877 INFO L131 PetriNetUnfolder]: For 11381/11588 co-relation queries the response was YES. [2022-12-13 01:33:25,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 1159 events. 170/1159 cut-off events. For 11381/11588 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11872 event pairs, 8 based on Foata normal form. 55/1181 useless extension candidates. Maximal degree in co-relation 4527. Up to 132 conditions per place. [2022-12-13 01:33:25,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 124 transitions, 1715 flow [2022-12-13 01:33:25,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 1060 [2022-12-13 01:33:25,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1890] L52-->L102-3: Formula: (and (= |v_#pthreadsForks_1048| (+ |v_#pthreadsForks_1049| 1)) (= (select (select |v_#memory_int_1456| v_~get_2~0.base_447) (+ (* v_~id_0~0_553 4) v_~get_2~0.offset_402)) |v_thread1Thread1of1ForFork1_minus_#in~a#1_174|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_198| |v_thread1Thread1of1ForFork1_minus_#in~b#1_172|) (= (select (select |v_#memory_int_1456| v_~get_5~0.base_382) (+ v_~get_5~0.offset_371 (* v_~id_3~0_537 4))) |v_thread1Thread1of1ForFork1_minus_#in~b#1_172|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_198| |v_thread1Thread1of1ForFork1_minus_#res#1_192|) |v_thread1Thread1of1ForFork1_minus_~a#1_198|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_158| 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_459|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_174| |v_thread1Thread1of1ForFork1_minus_~a#1_198|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_198|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_198| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_198| 2147483647))) 1 0)) (<= v_~result_9~0_226 2147483647) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|) (<= 0 (+ v_~result_9~0_226 2147483648)) (= |v_#memory_int_1455| (store |v_#memory_int_1456| |v_ULTIMATE.start_main_~#t2~0#1.base_142| (store (select |v_#memory_int_1456| |v_ULTIMATE.start_main_~#t2~0#1.base_142|) |v_ULTIMATE.start_main_~#t2~0#1.offset_142| |v_ULTIMATE.start_main_#t~pre48#1_548|))) (= |v_#pthreadsForks_1049| |v_ULTIMATE.start_main_#t~pre48#1_548|) (= v_~result_9~0_226 |v_thread1Thread1of1ForFork1_minus_#res#1_192|) (= 0 (mod (select (select |v_#memory_int_1456| v_~contains_key_1~0.base_381) (+ v_~id_0~0_553 v_~contains_key_1~0.offset_328)) 256)) (= |v_thread1Thread1of1ForFork1_#res#1.base_158| 0)) InVars {~get_2~0.offset=v_~get_2~0.offset_402, #pthreadsForks=|v_#pthreadsForks_1049|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, ~get_5~0.base=v_~get_5~0.base_382, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_328, ~id_3~0=v_~id_3~0_537, ~get_2~0.base=v_~get_2~0.base_447, #memory_int=|v_#memory_int_1456|, ~id_0~0=v_~id_0~0_553, ~get_5~0.offset=v_~get_5~0.offset_371, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_142|, ~contains_key_1~0.base=v_~contains_key_1~0.base_381} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_174|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_548|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_321|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_114|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_186|, ~result_9~0=v_~result_9~0_226, ~contains_key_1~0.base=v_~contains_key_1~0.base_381, #pthreadsForks=|v_#pthreadsForks_1048|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_184|, ~id_3~0=v_~id_3~0_537, ~get_2~0.base=v_~get_2~0.base_447, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_128|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_245|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_458|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_158|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_190|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_158|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_193|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_192|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_172|, ~get_2~0.offset=v_~get_2~0.offset_402, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_198|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, ~get_5~0.base=v_~get_5~0.base_382, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_328, #memory_int=|v_#memory_int_1455|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_198|, ~id_0~0=v_~id_0~0_553, ~get_5~0.offset=v_~get_5~0.offset_371, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_142|} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_459|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~nondet47#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre46#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:33:26,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:26,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-13 01:33:26,076 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 125 transitions, 1747 flow [2022-12-13 01:33:26,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:26,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:26,076 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, 1] [2022-12-13 01:33:26,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 01:33:26,076 INFO L420 AbstractCegarLoop]: === Iteration 65 === 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 01:33:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1000913687, now seen corresponding path program 1 times [2022-12-13 01:33:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215255750] [2022-12-13 01:33:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:26,338 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 01:33:26,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:26,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215255750] [2022-12-13 01:33:26,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215255750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:26,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:26,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:33:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979607672] [2022-12-13 01:33:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:26,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:33:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:33:26,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:33:26,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:33:26,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 125 transitions, 1747 flow. Second operand has 6 states, 5 states have (on average 5.2) 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 01:33:26,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:26,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:33:26,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:27,484 INFO L130 PetriNetUnfolder]: 4476/7878 cut-off events. [2022-12-13 01:33:27,484 INFO L131 PetriNetUnfolder]: For 87046/87046 co-relation queries the response was YES. [2022-12-13 01:33:27,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38674 conditions, 7878 events. 4476/7878 cut-off events. For 87046/87046 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 56900 event pairs, 1303 based on Foata normal form. 2/7875 useless extension candidates. Maximal degree in co-relation 38607. Up to 4849 conditions per place. [2022-12-13 01:33:27,533 INFO L137 encePairwiseOnDemand]: 44/57 looper letters, 130 selfloop transitions, 27 changer transitions 8/165 dead transitions. [2022-12-13 01:33:27,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 165 transitions, 2266 flow [2022-12-13 01:33:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:33:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:33:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-13 01:33:27,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30409356725146197 [2022-12-13 01:33:27,534 INFO L175 Difference]: Start difference. First operand has 142 places, 125 transitions, 1747 flow. Second operand 6 states and 104 transitions. [2022-12-13 01:33:27,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 165 transitions, 2266 flow [2022-12-13 01:33:27,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 165 transitions, 2243 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:33:27,887 INFO L231 Difference]: Finished difference. Result has 141 places, 123 transitions, 1719 flow [2022-12-13 01:33:27,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1719, PETRI_PLACES=141, PETRI_TRANSITIONS=123} [2022-12-13 01:33:27,887 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2022-12-13 01:33:27,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:27,888 INFO L89 Accepts]: Start accepts. Operand has 141 places, 123 transitions, 1719 flow [2022-12-13 01:33:27,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:27,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:27,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 123 transitions, 1719 flow [2022-12-13 01:33:27,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 1719 flow [2022-12-13 01:33:28,005 INFO L130 PetriNetUnfolder]: 170/1145 cut-off events. [2022-12-13 01:33:28,005 INFO L131 PetriNetUnfolder]: For 12658/12873 co-relation queries the response was YES. [2022-12-13 01:33:28,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 1145 events. 170/1145 cut-off events. For 12658/12873 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11626 event pairs, 8 based on Foata normal form. 54/1165 useless extension candidates. Maximal degree in co-relation 4569. Up to 132 conditions per place. [2022-12-13 01:33:28,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 123 transitions, 1719 flow [2022-12-13 01:33:28,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-13 01:33:28,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:33:28,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1826] L60-10-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_47| v_~result_12~0_81) (= |v_thread2Thread1of1ForFork2_#t~mem15#1_46| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_#res#1.base_23| 0) (<= v_~result_12~0_81 2147483647) (<= 0 (+ v_~result_12~0_81 2147483648)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_23| 0) (= (+ |v_thread2Thread1of1ForFork2_minus_#res#1_47| |v_thread2Thread1of1ForFork2_minus_~b#1_59|) |v_thread2Thread1of1ForFork2_minus_~a#1_59|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (select (select |v_#memory_int_374| v_~get_8~0.base_97) (+ (* v_~id_6~0_169 4) v_~get_8~0.offset_97)) |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_59| |v_thread2Thread1of1ForFork2_minus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_59| |v_thread2Thread1of1ForFork2_minus_#in~b#1_37|)) InVars {~id_6~0=v_~id_6~0_169, ~get_8~0.base=v_~get_8~0.base_97, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_46|, #memory_int=|v_#memory_int_374|} OutVars{~id_6~0=v_~id_6~0_169, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_23|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_59|, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_43|, ~get_8~0.base=v_~get_8~0.base_97, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_47|, ~get_8~0.offset=v_~get_8~0.offset_97, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_47|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_45|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_23|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_55|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_59|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_35|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_37|, #memory_int=|v_#memory_int_374|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_41|, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_71|, ~result_12~0=v_~result_12~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~mem16#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~short14#1, ~result_12~0] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:33:28,455 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:28,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 569 [2022-12-13 01:33:28,456 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 1761 flow [2022-12-13 01:33:28,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) 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 01:33:28,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:28,456 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, 1] [2022-12-13 01:33:28,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 01:33:28,456 INFO L420 AbstractCegarLoop]: === Iteration 66 === 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 01:33:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1385472742, now seen corresponding path program 1 times [2022-12-13 01:33:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:28,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376033637] [2022-12-13 01:33:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:28,816 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 01:33:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:28,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376033637] [2022-12-13 01:33:28,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376033637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:28,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:33:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571578714] [2022-12-13 01:33:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:28,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:33:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:28,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:33:28,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:33:28,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:33:28,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 123 transitions, 1761 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:28,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:28,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:33:28,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:30,302 INFO L130 PetriNetUnfolder]: 5930/10380 cut-off events. [2022-12-13 01:33:30,302 INFO L131 PetriNetUnfolder]: For 134983/134983 co-relation queries the response was YES. [2022-12-13 01:33:30,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51601 conditions, 10380 events. 5930/10380 cut-off events. For 134983/134983 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 78745 event pairs, 1988 based on Foata normal form. 2/10376 useless extension candidates. Maximal degree in co-relation 51537. Up to 5670 conditions per place. [2022-12-13 01:33:30,375 INFO L137 encePairwiseOnDemand]: 43/56 looper letters, 208 selfloop transitions, 22 changer transitions 15/245 dead transitions. [2022-12-13 01:33:30,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 245 transitions, 3898 flow [2022-12-13 01:33:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:33:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:33:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-13 01:33:30,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29591836734693877 [2022-12-13 01:33:30,376 INFO L175 Difference]: Start difference. First operand has 139 places, 123 transitions, 1761 flow. Second operand 7 states and 116 transitions. [2022-12-13 01:33:30,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 245 transitions, 3898 flow [2022-12-13 01:33:31,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 245 transitions, 3801 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 01:33:31,062 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 1857 flow [2022-12-13 01:33:31,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1857, PETRI_PLACES=145, PETRI_TRANSITIONS=127} [2022-12-13 01:33:31,062 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2022-12-13 01:33:31,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:31,062 INFO L89 Accepts]: Start accepts. Operand has 145 places, 127 transitions, 1857 flow [2022-12-13 01:33:31,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:31,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:31,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 127 transitions, 1857 flow [2022-12-13 01:33:31,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 127 transitions, 1857 flow [2022-12-13 01:33:31,307 INFO L130 PetriNetUnfolder]: 221/1475 cut-off events. [2022-12-13 01:33:31,308 INFO L131 PetriNetUnfolder]: For 16330/16666 co-relation queries the response was YES. [2022-12-13 01:33:31,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6086 conditions, 1475 events. 221/1475 cut-off events. For 16330/16666 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16085 event pairs, 11 based on Foata normal form. 91/1518 useless extension candidates. Maximal degree in co-relation 6026. Up to 179 conditions per place. [2022-12-13 01:33:31,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 127 transitions, 1857 flow [2022-12-13 01:33:31,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 1150 [2022-12-13 01:33:31,342 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:31,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-13 01:33:31,343 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 127 transitions, 1857 flow [2022-12-13 01:33:31,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:31,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:31,343 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, 1] [2022-12-13 01:33:31,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 01:33:31,343 INFO L420 AbstractCegarLoop]: === Iteration 67 === 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 01:33:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1632124392, now seen corresponding path program 1 times [2022-12-13 01:33:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:31,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852815340] [2022-12-13 01:33:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:31,624 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 01:33:31,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:31,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852815340] [2022-12-13 01:33:31,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852815340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:31,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:31,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:33:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770485104] [2022-12-13 01:33:31,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:31,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:33:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:33:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:33:31,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:33:31,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 127 transitions, 1857 flow. Second operand has 6 states, 5 states have (on average 5.2) 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 01:33:31,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:31,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:33:31,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:33,162 INFO L130 PetriNetUnfolder]: 5923/10346 cut-off events. [2022-12-13 01:33:33,162 INFO L131 PetriNetUnfolder]: For 129731/129731 co-relation queries the response was YES. [2022-12-13 01:33:33,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52508 conditions, 10346 events. 5923/10346 cut-off events. For 129731/129731 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 77624 event pairs, 1736 based on Foata normal form. 3/10343 useless extension candidates. Maximal degree in co-relation 52440. Up to 6510 conditions per place. [2022-12-13 01:33:33,232 INFO L137 encePairwiseOnDemand]: 44/56 looper letters, 132 selfloop transitions, 24 changer transitions 12/168 dead transitions. [2022-12-13 01:33:33,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 168 transitions, 2414 flow [2022-12-13 01:33:33,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:33:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:33:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-13 01:33:33,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30654761904761907 [2022-12-13 01:33:33,233 INFO L175 Difference]: Start difference. First operand has 142 places, 127 transitions, 1857 flow. Second operand 6 states and 103 transitions. [2022-12-13 01:33:33,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 168 transitions, 2414 flow [2022-12-13 01:33:33,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 168 transitions, 2371 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 01:33:33,819 INFO L231 Difference]: Finished difference. Result has 143 places, 123 transitions, 1750 flow [2022-12-13 01:33:33,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1750, PETRI_PLACES=143, PETRI_TRANSITIONS=123} [2022-12-13 01:33:33,819 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2022-12-13 01:33:33,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:33,820 INFO L89 Accepts]: Start accepts. Operand has 143 places, 123 transitions, 1750 flow [2022-12-13 01:33:33,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:33,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:33,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 123 transitions, 1750 flow [2022-12-13 01:33:33,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 1750 flow [2022-12-13 01:33:33,970 INFO L130 PetriNetUnfolder]: 221/1451 cut-off events. [2022-12-13 01:33:33,970 INFO L131 PetriNetUnfolder]: For 16616/16962 co-relation queries the response was YES. [2022-12-13 01:33:33,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 1451 events. 221/1451 cut-off events. For 16616/16962 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15744 event pairs, 13 based on Foata normal form. 91/1494 useless extension candidates. Maximal degree in co-relation 6002. Up to 182 conditions per place. [2022-12-13 01:33:33,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 123 transitions, 1750 flow [2022-12-13 01:33:33,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 1142 [2022-12-13 01:33:33,991 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:33,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 01:33:33,991 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 1750 flow [2022-12-13 01:33:33,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) 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 01:33:33,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:33,992 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, 1] [2022-12-13 01:33:33,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 01:33:33,992 INFO L420 AbstractCegarLoop]: === Iteration 68 === 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 01:33:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash 832987264, now seen corresponding path program 2 times [2022-12-13 01:33:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:33,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397240064] [2022-12-13 01:33:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:34,245 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 01:33:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:34,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397240064] [2022-12-13 01:33:34,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397240064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:34,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:34,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:33:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620154532] [2022-12-13 01:33:34,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:34,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:33:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:33:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:33:34,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:33:34,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 123 transitions, 1750 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:34,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:34,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:33:34,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:35,825 INFO L130 PetriNetUnfolder]: 5933/10377 cut-off events. [2022-12-13 01:33:35,825 INFO L131 PetriNetUnfolder]: For 140745/140745 co-relation queries the response was YES. [2022-12-13 01:33:35,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53227 conditions, 10377 events. 5933/10377 cut-off events. For 140745/140745 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 77506 event pairs, 3040 based on Foata normal form. 2/10373 useless extension candidates. Maximal degree in co-relation 53162. Up to 6769 conditions per place. [2022-12-13 01:33:35,899 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 185 selfloop transitions, 15 changer transitions 12/212 dead transitions. [2022-12-13 01:33:35,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 212 transitions, 3142 flow [2022-12-13 01:33:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:33:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:33:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-13 01:33:35,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28835978835978837 [2022-12-13 01:33:35,900 INFO L175 Difference]: Start difference. First operand has 139 places, 123 transitions, 1750 flow. Second operand 7 states and 109 transitions. [2022-12-13 01:33:35,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 212 transitions, 3142 flow [2022-12-13 01:33:36,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 212 transitions, 3006 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-13 01:33:36,535 INFO L231 Difference]: Finished difference. Result has 143 places, 126 transitions, 1806 flow [2022-12-13 01:33:36,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1806, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2022-12-13 01:33:36,535 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2022-12-13 01:33:36,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:36,535 INFO L89 Accepts]: Start accepts. Operand has 143 places, 126 transitions, 1806 flow [2022-12-13 01:33:36,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:36,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:36,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 126 transitions, 1806 flow [2022-12-13 01:33:36,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 126 transitions, 1806 flow [2022-12-13 01:33:36,685 INFO L130 PetriNetUnfolder]: 221/1470 cut-off events. [2022-12-13 01:33:36,686 INFO L131 PetriNetUnfolder]: For 15650/15988 co-relation queries the response was YES. [2022-12-13 01:33:36,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6014 conditions, 1470 events. 221/1470 cut-off events. For 15650/15988 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16054 event pairs, 13 based on Foata normal form. 89/1511 useless extension candidates. Maximal degree in co-relation 5956. Up to 182 conditions per place. [2022-12-13 01:33:36,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 126 transitions, 1806 flow [2022-12-13 01:33:36,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-13 01:33:36,711 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:36,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 01:33:36,712 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 1806 flow [2022-12-13 01:33:36,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:36,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:36,712 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, 1] [2022-12-13 01:33:36,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 01:33:36,712 INFO L420 AbstractCegarLoop]: === Iteration 69 === 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 01:33:36,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1106175814, now seen corresponding path program 3 times [2022-12-13 01:33:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:36,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408057128] [2022-12-13 01:33:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:37,053 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 01:33:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:37,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408057128] [2022-12-13 01:33:37,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408057128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:37,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:37,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:33:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433173965] [2022-12-13 01:33:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:37,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:33:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:37,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:33:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:33:37,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:33:37,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 1806 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:37,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:37,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:33:37,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:38,720 INFO L130 PetriNetUnfolder]: 5927/10355 cut-off events. [2022-12-13 01:33:38,720 INFO L131 PetriNetUnfolder]: For 128707/128707 co-relation queries the response was YES. [2022-12-13 01:33:38,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52354 conditions, 10355 events. 5927/10355 cut-off events. For 128707/128707 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 77204 event pairs, 3040 based on Foata normal form. 2/10351 useless extension candidates. Maximal degree in co-relation 52288. Up to 6769 conditions per place. [2022-12-13 01:33:38,787 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 173 selfloop transitions, 12 changer transitions 20/205 dead transitions. [2022-12-13 01:33:38,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 205 transitions, 3060 flow [2022-12-13 01:33:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:33:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:33:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-13 01:33:38,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2698412698412698 [2022-12-13 01:33:38,789 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 1806 flow. Second operand 7 states and 102 transitions. [2022-12-13 01:33:38,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 205 transitions, 3060 flow [2022-12-13 01:33:39,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 205 transitions, 3032 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 01:33:39,287 INFO L231 Difference]: Finished difference. Result has 146 places, 123 transitions, 1724 flow [2022-12-13 01:33:39,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1724, PETRI_PLACES=146, PETRI_TRANSITIONS=123} [2022-12-13 01:33:39,287 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2022-12-13 01:33:39,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:39,288 INFO L89 Accepts]: Start accepts. Operand has 146 places, 123 transitions, 1724 flow [2022-12-13 01:33:39,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:39,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:39,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 123 transitions, 1724 flow [2022-12-13 01:33:39,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 123 transitions, 1724 flow [2022-12-13 01:33:39,432 INFO L130 PetriNetUnfolder]: 221/1446 cut-off events. [2022-12-13 01:33:39,432 INFO L131 PetriNetUnfolder]: For 15065/15397 co-relation queries the response was YES. [2022-12-13 01:33:39,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 1446 events. 221/1446 cut-off events. For 15065/15397 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15661 event pairs, 13 based on Foata normal form. 85/1479 useless extension candidates. Maximal degree in co-relation 5886. Up to 182 conditions per place. [2022-12-13 01:33:39,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 123 transitions, 1724 flow [2022-12-13 01:33:39,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-13 01:33:39,456 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:39,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 01:33:39,457 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 123 transitions, 1724 flow [2022-12-13 01:33:39,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:33:39,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:39,457 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, 1] [2022-12-13 01:33:39,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 01:33:39,457 INFO L420 AbstractCegarLoop]: === Iteration 70 === 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 01:33:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1674842783, now seen corresponding path program 1 times [2022-12-13 01:33:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:39,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979644599] [2022-12-13 01:33:39,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:40,086 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 01:33:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:40,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979644599] [2022-12-13 01:33:40,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979644599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:40,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:40,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:33:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830799130] [2022-12-13 01:33:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:33:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:33:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:33:40,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:33:40,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 123 transitions, 1724 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:40,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:40,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:33:40,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:41,787 INFO L130 PetriNetUnfolder]: 5870/10239 cut-off events. [2022-12-13 01:33:41,787 INFO L131 PetriNetUnfolder]: For 126728/126728 co-relation queries the response was YES. [2022-12-13 01:33:41,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51902 conditions, 10239 events. 5870/10239 cut-off events. For 126728/126728 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 75873 event pairs, 4343 based on Foata normal form. 1/10234 useless extension candidates. Maximal degree in co-relation 51836. Up to 9998 conditions per place. [2022-12-13 01:33:41,867 INFO L137 encePairwiseOnDemand]: 46/54 looper letters, 145 selfloop transitions, 7 changer transitions 11/163 dead transitions. [2022-12-13 01:33:41,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 163 transitions, 2243 flow [2022-12-13 01:33:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-13 01:33:41,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-13 01:33:41,868 INFO L175 Difference]: Start difference. First operand has 141 places, 123 transitions, 1724 flow. Second operand 8 states and 96 transitions. [2022-12-13 01:33:41,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 163 transitions, 2243 flow [2022-12-13 01:33:42,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 163 transitions, 2169 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-13 01:33:42,374 INFO L231 Difference]: Finished difference. Result has 143 places, 125 transitions, 1722 flow [2022-12-13 01:33:42,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1722, PETRI_PLACES=143, PETRI_TRANSITIONS=125} [2022-12-13 01:33:42,375 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2022-12-13 01:33:42,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:42,375 INFO L89 Accepts]: Start accepts. Operand has 143 places, 125 transitions, 1722 flow [2022-12-13 01:33:42,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:42,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:42,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 125 transitions, 1722 flow [2022-12-13 01:33:42,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 125 transitions, 1722 flow [2022-12-13 01:33:42,540 INFO L130 PetriNetUnfolder]: 220/1444 cut-off events. [2022-12-13 01:33:42,541 INFO L131 PetriNetUnfolder]: For 14347/14682 co-relation queries the response was YES. [2022-12-13 01:33:42,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 1444 events. 220/1444 cut-off events. For 14347/14682 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15652 event pairs, 13 based on Foata normal form. 90/1487 useless extension candidates. Maximal degree in co-relation 5797. Up to 182 conditions per place. [2022-12-13 01:33:42,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 125 transitions, 1722 flow [2022-12-13 01:33:42,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 01:33:42,558 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:42,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 01:33:42,558 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 125 transitions, 1722 flow [2022-12-13 01:33:42,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:42,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:42,559 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, 1] [2022-12-13 01:33:42,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 01:33:42,559 INFO L420 AbstractCegarLoop]: === Iteration 71 === 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 01:33:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash 880771710, now seen corresponding path program 1 times [2022-12-13 01:33:42,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:42,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046354930] [2022-12-13 01:33:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:42,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:43,142 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 01:33:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:43,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046354930] [2022-12-13 01:33:43,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046354930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:43,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:43,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:33:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948198602] [2022-12-13 01:33:43,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:43,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:33:43,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:43,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:33:43,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:33:43,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:33:43,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 125 transitions, 1722 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:43,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:43,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:33:43,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:45,101 INFO L130 PetriNetUnfolder]: 6120/10793 cut-off events. [2022-12-13 01:33:45,101 INFO L131 PetriNetUnfolder]: For 130340/130340 co-relation queries the response was YES. [2022-12-13 01:33:45,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54295 conditions, 10793 events. 6120/10793 cut-off events. For 130340/130340 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 82178 event pairs, 4141 based on Foata normal form. 3/10791 useless extension candidates. Maximal degree in co-relation 54229. Up to 9414 conditions per place. [2022-12-13 01:33:45,164 INFO L137 encePairwiseOnDemand]: 43/54 looper letters, 168 selfloop transitions, 14 changer transitions 14/196 dead transitions. [2022-12-13 01:33:45,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 196 transitions, 2818 flow [2022-12-13 01:33:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:33:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:33:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-12-13 01:33:45,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2139917695473251 [2022-12-13 01:33:45,165 INFO L175 Difference]: Start difference. First operand has 142 places, 125 transitions, 1722 flow. Second operand 9 states and 104 transitions. [2022-12-13 01:33:45,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 196 transitions, 2818 flow [2022-12-13 01:33:45,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 196 transitions, 2805 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 01:33:45,794 INFO L231 Difference]: Finished difference. Result has 151 places, 132 transitions, 1902 flow [2022-12-13 01:33:45,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1902, PETRI_PLACES=151, PETRI_TRANSITIONS=132} [2022-12-13 01:33:45,795 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places. [2022-12-13 01:33:45,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:45,795 INFO L89 Accepts]: Start accepts. Operand has 151 places, 132 transitions, 1902 flow [2022-12-13 01:33:45,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:45,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:45,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 132 transitions, 1902 flow [2022-12-13 01:33:45,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 132 transitions, 1902 flow [2022-12-13 01:33:46,018 INFO L130 PetriNetUnfolder]: 234/1533 cut-off events. [2022-12-13 01:33:46,018 INFO L131 PetriNetUnfolder]: For 17716/18084 co-relation queries the response was YES. [2022-12-13 01:33:46,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 1533 events. 234/1533 cut-off events. For 17716/18084 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16859 event pairs, 10 based on Foata normal form. 95/1586 useless extension candidates. Maximal degree in co-relation 6502. Up to 191 conditions per place. [2022-12-13 01:33:46,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 132 transitions, 1902 flow [2022-12-13 01:33:46,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 1210 [2022-12-13 01:33:46,257 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:46,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-13 01:33:46,258 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 131 transitions, 1896 flow [2022-12-13 01:33:46,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:46,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:46,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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:33:46,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 01:33:46,258 INFO L420 AbstractCegarLoop]: === Iteration 72 === 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 01:33:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1316224303, now seen corresponding path program 2 times [2022-12-13 01:33:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:46,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770683233] [2022-12-13 01:33:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:46,994 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 01:33:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:46,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770683233] [2022-12-13 01:33:46,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770683233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:46,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:46,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:33:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12481474] [2022-12-13 01:33:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:46,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:33:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:46,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:33:46,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:33:46,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:33:46,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 131 transitions, 1896 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:46,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:46,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:33:46,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:49,053 INFO L130 PetriNetUnfolder]: 6064/10683 cut-off events. [2022-12-13 01:33:49,053 INFO L131 PetriNetUnfolder]: For 139788/139788 co-relation queries the response was YES. [2022-12-13 01:33:49,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55237 conditions, 10683 events. 6064/10683 cut-off events. For 139788/139788 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 80786 event pairs, 4545 based on Foata normal form. 1/10679 useless extension candidates. Maximal degree in co-relation 55167. Up to 10562 conditions per place. [2022-12-13 01:33:49,121 INFO L137 encePairwiseOnDemand]: 48/56 looper letters, 142 selfloop transitions, 7 changer transitions 11/160 dead transitions. [2022-12-13 01:33:49,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 160 transitions, 2338 flow [2022-12-13 01:33:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:33:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:33:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2022-12-13 01:33:49,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1746031746031746 [2022-12-13 01:33:49,122 INFO L175 Difference]: Start difference. First operand has 148 places, 131 transitions, 1896 flow. Second operand 9 states and 88 transitions. [2022-12-13 01:33:49,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 160 transitions, 2338 flow [2022-12-13 01:33:49,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 160 transitions, 2287 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-13 01:33:49,718 INFO L231 Difference]: Finished difference. Result has 152 places, 132 transitions, 1880 flow [2022-12-13 01:33:49,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1880, PETRI_PLACES=152, PETRI_TRANSITIONS=132} [2022-12-13 01:33:49,719 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2022-12-13 01:33:49,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:49,719 INFO L89 Accepts]: Start accepts. Operand has 152 places, 132 transitions, 1880 flow [2022-12-13 01:33:49,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:49,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:49,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 132 transitions, 1880 flow [2022-12-13 01:33:49,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 132 transitions, 1880 flow [2022-12-13 01:33:49,870 INFO L130 PetriNetUnfolder]: 233/1528 cut-off events. [2022-12-13 01:33:49,870 INFO L131 PetriNetUnfolder]: For 17312/17683 co-relation queries the response was YES. [2022-12-13 01:33:49,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6455 conditions, 1528 events. 233/1528 cut-off events. For 17312/17683 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16836 event pairs, 10 based on Foata normal form. 91/1571 useless extension candidates. Maximal degree in co-relation 6394. Up to 191 conditions per place. [2022-12-13 01:33:49,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 132 transitions, 1880 flow [2022-12-13 01:33:49,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 1206 [2022-12-13 01:33:49,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] and [1890] L52-->L102-3: Formula: (and (= |v_#pthreadsForks_1048| (+ |v_#pthreadsForks_1049| 1)) (= (select (select |v_#memory_int_1456| v_~get_2~0.base_447) (+ (* v_~id_0~0_553 4) v_~get_2~0.offset_402)) |v_thread1Thread1of1ForFork1_minus_#in~a#1_174|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_198| |v_thread1Thread1of1ForFork1_minus_#in~b#1_172|) (= (select (select |v_#memory_int_1456| v_~get_5~0.base_382) (+ v_~get_5~0.offset_371 (* v_~id_3~0_537 4))) |v_thread1Thread1of1ForFork1_minus_#in~b#1_172|) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_198| |v_thread1Thread1of1ForFork1_minus_#res#1_192|) |v_thread1Thread1of1ForFork1_minus_~a#1_198|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_158| 0) (not |v_thread1Thread1of1ForFork1_#t~short5#1_459|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_174| |v_thread1Thread1of1ForFork1_minus_~a#1_198|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_198|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_198| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_198| 2147483647))) 1 0)) (<= v_~result_9~0_226 2147483647) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|) (<= 0 (+ v_~result_9~0_226 2147483648)) (= |v_#memory_int_1455| (store |v_#memory_int_1456| |v_ULTIMATE.start_main_~#t2~0#1.base_142| (store (select |v_#memory_int_1456| |v_ULTIMATE.start_main_~#t2~0#1.base_142|) |v_ULTIMATE.start_main_~#t2~0#1.offset_142| |v_ULTIMATE.start_main_#t~pre48#1_548|))) (= |v_#pthreadsForks_1049| |v_ULTIMATE.start_main_#t~pre48#1_548|) (= v_~result_9~0_226 |v_thread1Thread1of1ForFork1_minus_#res#1_192|) (= 0 (mod (select (select |v_#memory_int_1456| v_~contains_key_1~0.base_381) (+ v_~id_0~0_553 v_~contains_key_1~0.offset_328)) 256)) (= |v_thread1Thread1of1ForFork1_#res#1.base_158| 0)) InVars {~get_2~0.offset=v_~get_2~0.offset_402, #pthreadsForks=|v_#pthreadsForks_1049|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, ~get_5~0.base=v_~get_5~0.base_382, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_328, ~id_3~0=v_~id_3~0_537, ~get_2~0.base=v_~get_2~0.base_447, #memory_int=|v_#memory_int_1456|, ~id_0~0=v_~id_0~0_553, ~get_5~0.offset=v_~get_5~0.offset_371, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_142|, ~contains_key_1~0.base=v_~contains_key_1~0.base_381} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_174|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_548|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_142|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_321|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_114|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_186|, ~result_9~0=v_~result_9~0_226, ~contains_key_1~0.base=v_~contains_key_1~0.base_381, #pthreadsForks=|v_#pthreadsForks_1048|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_184|, ~id_3~0=v_~id_3~0_537, ~get_2~0.base=v_~get_2~0.base_447, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_128|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_245|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_458|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_158|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_190|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_158|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_218|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_193|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_192|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_172|, ~get_2~0.offset=v_~get_2~0.offset_402, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_198|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, ~get_5~0.base=v_~get_5~0.base_382, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_328, #memory_int=|v_#memory_int_1455|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_198|, ~id_0~0=v_~id_0~0_553, ~get_5~0.offset=v_~get_5~0.offset_371, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_142|} AuxVars[|v_thread1Thread1of1ForFork1_#t~short5#1_459|] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, ULTIMATE.start_main_#t~pre48#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, ULTIMATE.start_main_#t~nondet47#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, #pthreadsForks, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre46#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:33:50,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:33:50,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-13 01:33:50,057 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 133 transitions, 1915 flow [2022-12-13 01:33:50,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:33:50,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:50,057 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 01:33:50,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 01:33:50,058 INFO L420 AbstractCegarLoop]: === Iteration 73 === 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 01:33:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 563920756, now seen corresponding path program 1 times [2022-12-13 01:33:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:50,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177238078] [2022-12-13 01:33:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:50,599 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 01:33:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:50,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177238078] [2022-12-13 01:33:50,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177238078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:50,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:50,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:33:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906170761] [2022-12-13 01:33:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:50,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:33:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:33:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:33:50,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:33:50,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 133 transitions, 1915 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:50,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:50,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:33:50,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:52,406 INFO L130 PetriNetUnfolder]: 6118/10856 cut-off events. [2022-12-13 01:33:52,407 INFO L131 PetriNetUnfolder]: For 137983/137983 co-relation queries the response was YES. [2022-12-13 01:33:52,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55508 conditions, 10856 events. 6118/10856 cut-off events. For 137983/137983 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 83470 event pairs, 4115 based on Foata normal form. 3/10854 useless extension candidates. Maximal degree in co-relation 55439. Up to 9397 conditions per place. [2022-12-13 01:33:52,478 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 179 selfloop transitions, 14 changer transitions 9/202 dead transitions. [2022-12-13 01:33:52,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 202 transitions, 2930 flow [2022-12-13 01:33:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-12-13 01:33:52,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2412280701754386 [2022-12-13 01:33:52,479 INFO L175 Difference]: Start difference. First operand has 152 places, 133 transitions, 1915 flow. Second operand 8 states and 110 transitions. [2022-12-13 01:33:52,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 202 transitions, 2930 flow [2022-12-13 01:33:52,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 202 transitions, 2910 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 01:33:52,994 INFO L231 Difference]: Finished difference. Result has 156 places, 134 transitions, 1951 flow [2022-12-13 01:33:52,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1951, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2022-12-13 01:33:52,994 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2022-12-13 01:33:52,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:52,995 INFO L89 Accepts]: Start accepts. Operand has 156 places, 134 transitions, 1951 flow [2022-12-13 01:33:52,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:52,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:52,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 134 transitions, 1951 flow [2022-12-13 01:33:52,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 134 transitions, 1951 flow [2022-12-13 01:33:53,161 INFO L130 PetriNetUnfolder]: 236/1594 cut-off events. [2022-12-13 01:33:53,162 INFO L131 PetriNetUnfolder]: For 18921/19301 co-relation queries the response was YES. [2022-12-13 01:33:53,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6812 conditions, 1594 events. 236/1594 cut-off events. For 18921/19301 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17856 event pairs, 10 based on Foata normal form. 93/1641 useless extension candidates. Maximal degree in co-relation 6755. Up to 200 conditions per place. [2022-12-13 01:33:53,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 134 transitions, 1951 flow [2022-12-13 01:33:53,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 1226 [2022-12-13 01:33:53,178 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:53,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 01:33:53,178 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 134 transitions, 1951 flow [2022-12-13 01:33:53,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:53,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:53,178 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 01:33:53,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 01:33:53,179 INFO L420 AbstractCegarLoop]: === Iteration 74 === 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 01:33:53,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash -870928812, now seen corresponding path program 2 times [2022-12-13 01:33:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:53,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045462840] [2022-12-13 01:33:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:53,821 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 01:33:53,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:53,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045462840] [2022-12-13 01:33:53,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045462840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:53,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:53,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:33:53,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999365286] [2022-12-13 01:33:53,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:53,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:33:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:53,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:33:53,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:33:53,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:33:53,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 134 transitions, 1951 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:53,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:53,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:33:53,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:55,556 INFO L130 PetriNetUnfolder]: 6094/10832 cut-off events. [2022-12-13 01:33:55,556 INFO L131 PetriNetUnfolder]: For 146505/146505 co-relation queries the response was YES. [2022-12-13 01:33:55,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56248 conditions, 10832 events. 6094/10832 cut-off events. For 146505/146505 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 83081 event pairs, 4313 based on Foata normal form. 3/10830 useless extension candidates. Maximal degree in co-relation 56177. Up to 10102 conditions per place. [2022-12-13 01:33:55,636 INFO L137 encePairwiseOnDemand]: 47/56 looper letters, 165 selfloop transitions, 12 changer transitions 9/186 dead transitions. [2022-12-13 01:33:55,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 186 transitions, 2805 flow [2022-12-13 01:33:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:33:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:33:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-12-13 01:33:55,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21875 [2022-12-13 01:33:55,637 INFO L175 Difference]: Start difference. First operand has 155 places, 134 transitions, 1951 flow. Second operand 8 states and 98 transitions. [2022-12-13 01:33:55,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 186 transitions, 2805 flow [2022-12-13 01:33:56,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 186 transitions, 2761 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 01:33:56,172 INFO L231 Difference]: Finished difference. Result has 158 places, 135 transitions, 1963 flow [2022-12-13 01:33:56,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1963, PETRI_PLACES=158, PETRI_TRANSITIONS=135} [2022-12-13 01:33:56,173 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places. [2022-12-13 01:33:56,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:56,173 INFO L89 Accepts]: Start accepts. Operand has 158 places, 135 transitions, 1963 flow [2022-12-13 01:33:56,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:56,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:56,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 135 transitions, 1963 flow [2022-12-13 01:33:56,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 135 transitions, 1963 flow [2022-12-13 01:33:56,339 INFO L130 PetriNetUnfolder]: 230/1585 cut-off events. [2022-12-13 01:33:56,339 INFO L131 PetriNetUnfolder]: For 19191/19570 co-relation queries the response was YES. [2022-12-13 01:33:56,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6841 conditions, 1585 events. 230/1585 cut-off events. For 19191/19570 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17775 event pairs, 10 based on Foata normal form. 95/1634 useless extension candidates. Maximal degree in co-relation 6778. Up to 196 conditions per place. [2022-12-13 01:33:56,358 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 135 transitions, 1963 flow [2022-12-13 01:33:56,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-13 01:33:56,359 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:33:56,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-13 01:33:56,360 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 135 transitions, 1963 flow [2022-12-13 01:33:56,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:33:56,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:33:56,360 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, 1] [2022-12-13 01:33:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 01:33:56,360 INFO L420 AbstractCegarLoop]: === Iteration 75 === 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 01:33:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:33:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -820960322, now seen corresponding path program 2 times [2022-12-13 01:33:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:33:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674803701] [2022-12-13 01:33:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:33:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:33:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:33:57,031 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 01:33:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:33:57,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674803701] [2022-12-13 01:33:57,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674803701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:33:57,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:33:57,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:33:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086860525] [2022-12-13 01:33:57,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:33:57,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:33:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:33:57,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:33:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:33:57,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:33:57,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 135 transitions, 1963 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:33:57,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:33:57,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:33:57,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:33:59,139 INFO L130 PetriNetUnfolder]: 6738/12342 cut-off events. [2022-12-13 01:33:59,139 INFO L131 PetriNetUnfolder]: For 165652/165652 co-relation queries the response was YES. [2022-12-13 01:33:59,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64396 conditions, 12342 events. 6738/12342 cut-off events. For 165652/165652 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 100299 event pairs, 2767 based on Foata normal form. 10/12347 useless extension candidates. Maximal degree in co-relation 64325. Up to 5097 conditions per place. [2022-12-13 01:33:59,223 INFO L137 encePairwiseOnDemand]: 39/54 looper letters, 200 selfloop transitions, 28 changer transitions 18/246 dead transitions. [2022-12-13 01:33:59,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 246 transitions, 3843 flow [2022-12-13 01:33:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:33:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:33:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-12-13 01:33:59,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21296296296296297 [2022-12-13 01:33:59,224 INFO L175 Difference]: Start difference. First operand has 157 places, 135 transitions, 1963 flow. Second operand 10 states and 115 transitions. [2022-12-13 01:33:59,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 246 transitions, 3843 flow [2022-12-13 01:33:59,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 246 transitions, 3805 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-13 01:33:59,842 INFO L231 Difference]: Finished difference. Result has 163 places, 142 transitions, 2142 flow [2022-12-13 01:33:59,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2142, PETRI_PLACES=163, PETRI_TRANSITIONS=142} [2022-12-13 01:33:59,842 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2022-12-13 01:33:59,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:33:59,842 INFO L89 Accepts]: Start accepts. Operand has 163 places, 142 transitions, 2142 flow [2022-12-13 01:33:59,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:33:59,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:33:59,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 142 transitions, 2142 flow [2022-12-13 01:33:59,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 142 transitions, 2142 flow [2022-12-13 01:34:00,167 INFO L130 PetriNetUnfolder]: 259/1958 cut-off events. [2022-12-13 01:34:00,167 INFO L131 PetriNetUnfolder]: For 26928/27419 co-relation queries the response was YES. [2022-12-13 01:34:00,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8651 conditions, 1958 events. 259/1958 cut-off events. For 26928/27419 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 23258 event pairs, 19 based on Foata normal form. 132/2035 useless extension candidates. Maximal degree in co-relation 8585. Up to 230 conditions per place. [2022-12-13 01:34:00,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 142 transitions, 2142 flow [2022-12-13 01:34:00,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-13 01:34:00,188 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:00,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-13 01:34:00,188 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 142 transitions, 2142 flow [2022-12-13 01:34:00,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:34:00,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:00,189 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, 1] [2022-12-13 01:34:00,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 01:34:00,189 INFO L420 AbstractCegarLoop]: === Iteration 76 === 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 01:34:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2040236031, now seen corresponding path program 3 times [2022-12-13 01:34:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:00,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858147801] [2022-12-13 01:34:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:00,870 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 01:34:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:00,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858147801] [2022-12-13 01:34:00,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858147801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:00,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:00,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:34:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521218141] [2022-12-13 01:34:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:00,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:34:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:00,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:34:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:34:00,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:00,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 142 transitions, 2142 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:34:00,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:00,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:00,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:03,088 INFO L130 PetriNetUnfolder]: 6609/12127 cut-off events. [2022-12-13 01:34:03,089 INFO L131 PetriNetUnfolder]: For 180695/180695 co-relation queries the response was YES. [2022-12-13 01:34:03,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65596 conditions, 12127 events. 6609/12127 cut-off events. For 180695/180695 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 98065 event pairs, 4675 based on Foata normal form. 3/12126 useless extension candidates. Maximal degree in co-relation 65522. Up to 10683 conditions per place. [2022-12-13 01:34:03,174 INFO L137 encePairwiseOnDemand]: 46/54 looper letters, 166 selfloop transitions, 12 changer transitions 35/213 dead transitions. [2022-12-13 01:34:03,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 213 transitions, 2928 flow [2022-12-13 01:34:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:34:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:34:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-12-13 01:34:03,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22962962962962963 [2022-12-13 01:34:03,176 INFO L175 Difference]: Start difference. First operand has 161 places, 142 transitions, 2142 flow. Second operand 10 states and 124 transitions. [2022-12-13 01:34:03,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 213 transitions, 2928 flow [2022-12-13 01:34:03,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 213 transitions, 2884 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-13 01:34:03,943 INFO L231 Difference]: Finished difference. Result has 169 places, 142 transitions, 2175 flow [2022-12-13 01:34:03,943 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2175, PETRI_PLACES=169, PETRI_TRANSITIONS=142} [2022-12-13 01:34:03,943 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2022-12-13 01:34:03,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:03,943 INFO L89 Accepts]: Start accepts. Operand has 169 places, 142 transitions, 2175 flow [2022-12-13 01:34:03,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:03,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:03,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 142 transitions, 2175 flow [2022-12-13 01:34:03,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 142 transitions, 2175 flow [2022-12-13 01:34:04,152 INFO L130 PetriNetUnfolder]: 257/1961 cut-off events. [2022-12-13 01:34:04,152 INFO L131 PetriNetUnfolder]: For 26920/27409 co-relation queries the response was YES. [2022-12-13 01:34:04,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8765 conditions, 1961 events. 257/1961 cut-off events. For 26920/27409 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23384 event pairs, 19 based on Foata normal form. 123/2027 useless extension candidates. Maximal degree in co-relation 8697. Up to 230 conditions per place. [2022-12-13 01:34:04,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 142 transitions, 2175 flow [2022-12-13 01:34:04,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 1278 [2022-12-13 01:34:04,174 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:04,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-13 01:34:04,175 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 142 transitions, 2175 flow [2022-12-13 01:34:04,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:34:04,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:04,175 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, 1] [2022-12-13 01:34:04,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 01:34:04,175 INFO L420 AbstractCegarLoop]: === Iteration 77 === 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 01:34:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1188732944, now seen corresponding path program 3 times [2022-12-13 01:34:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:04,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017568107] [2022-12-13 01:34:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:04,794 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 01:34:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:04,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017568107] [2022-12-13 01:34:04,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017568107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:04,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:04,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:34:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867811137] [2022-12-13 01:34:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:04,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:34:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:04,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:34:04,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:34:04,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:04,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 142 transitions, 2175 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:34:04,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:04,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:04,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:06,891 INFO L130 PetriNetUnfolder]: 6803/12585 cut-off events. [2022-12-13 01:34:06,891 INFO L131 PetriNetUnfolder]: For 181676/181676 co-relation queries the response was YES. [2022-12-13 01:34:06,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68437 conditions, 12585 events. 6803/12585 cut-off events. For 181676/181676 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 103560 event pairs, 4280 based on Foata normal form. 13/12592 useless extension candidates. Maximal degree in co-relation 68361. Up to 10005 conditions per place. [2022-12-13 01:34:06,975 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 165 selfloop transitions, 34 changer transitions 16/215 dead transitions. [2022-12-13 01:34:06,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 215 transitions, 3484 flow [2022-12-13 01:34:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:34:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:34:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-13 01:34:06,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19547325102880658 [2022-12-13 01:34:06,976 INFO L175 Difference]: Start difference. First operand has 162 places, 142 transitions, 2175 flow. Second operand 9 states and 95 transitions. [2022-12-13 01:34:06,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 215 transitions, 3484 flow [2022-12-13 01:34:07,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 215 transitions, 3446 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-13 01:34:07,913 INFO L231 Difference]: Finished difference. Result has 168 places, 159 transitions, 2557 flow [2022-12-13 01:34:07,914 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2557, PETRI_PLACES=168, PETRI_TRANSITIONS=159} [2022-12-13 01:34:07,914 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places. [2022-12-13 01:34:07,914 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:07,914 INFO L89 Accepts]: Start accepts. Operand has 168 places, 159 transitions, 2557 flow [2022-12-13 01:34:07,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:07,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:07,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 159 transitions, 2557 flow [2022-12-13 01:34:07,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 159 transitions, 2557 flow [2022-12-13 01:34:08,156 INFO L130 PetriNetUnfolder]: 350/2244 cut-off events. [2022-12-13 01:34:08,157 INFO L131 PetriNetUnfolder]: For 36106/36639 co-relation queries the response was YES. [2022-12-13 01:34:08,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 2244 events. 350/2244 cut-off events. For 36106/36639 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 26494 event pairs, 19 based on Foata normal form. 123/2322 useless extension candidates. Maximal degree in co-relation 11173. Up to 334 conditions per place. [2022-12-13 01:34:08,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 159 transitions, 2557 flow [2022-12-13 01:34:08,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-13 01:34:08,181 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:08,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-13 01:34:08,181 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 159 transitions, 2557 flow [2022-12-13 01:34:08,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:34:08,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:08,181 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, 1] [2022-12-13 01:34:08,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 01:34:08,182 INFO L420 AbstractCegarLoop]: === Iteration 78 === 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 01:34:08,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1433012290, now seen corresponding path program 4 times [2022-12-13 01:34:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:08,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097069804] [2022-12-13 01:34:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:08,774 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 01:34:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:08,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097069804] [2022-12-13 01:34:08,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097069804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:08,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:08,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 01:34:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977369824] [2022-12-13 01:34:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:08,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:34:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:34:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:34:08,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:08,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 159 transitions, 2557 flow. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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 01:34:08,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:08,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:08,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:11,027 INFO L130 PetriNetUnfolder]: 6904/12722 cut-off events. [2022-12-13 01:34:11,027 INFO L131 PetriNetUnfolder]: For 207833/207833 co-relation queries the response was YES. [2022-12-13 01:34:11,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73556 conditions, 12722 events. 6904/12722 cut-off events. For 207833/207833 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 104674 event pairs, 4843 based on Foata normal form. 3/12720 useless extension candidates. Maximal degree in co-relation 73479. Up to 11019 conditions per place. [2022-12-13 01:34:11,145 INFO L137 encePairwiseOnDemand]: 45/54 looper letters, 202 selfloop transitions, 13 changer transitions 14/229 dead transitions. [2022-12-13 01:34:11,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 229 transitions, 3680 flow [2022-12-13 01:34:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:34:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:34:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-12-13 01:34:11,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22633744855967078 [2022-12-13 01:34:11,146 INFO L175 Difference]: Start difference. First operand has 166 places, 159 transitions, 2557 flow. Second operand 9 states and 110 transitions. [2022-12-13 01:34:11,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 229 transitions, 3680 flow [2022-12-13 01:34:12,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 229 transitions, 3560 flow, removed 41 selfloop flow, removed 6 redundant places. [2022-12-13 01:34:12,349 INFO L231 Difference]: Finished difference. Result has 172 places, 160 transitions, 2543 flow [2022-12-13 01:34:12,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2471, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2543, PETRI_PLACES=172, PETRI_TRANSITIONS=160} [2022-12-13 01:34:12,350 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2022-12-13 01:34:12,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:12,350 INFO L89 Accepts]: Start accepts. Operand has 172 places, 160 transitions, 2543 flow [2022-12-13 01:34:12,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:12,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:12,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 160 transitions, 2543 flow [2022-12-13 01:34:12,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 160 transitions, 2543 flow [2022-12-13 01:34:12,723 INFO L130 PetriNetUnfolder]: 347/2304 cut-off events. [2022-12-13 01:34:12,724 INFO L131 PetriNetUnfolder]: For 33545/34085 co-relation queries the response was YES. [2022-12-13 01:34:12,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 2304 events. 347/2304 cut-off events. For 33545/34085 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 27639 event pairs, 28 based on Foata normal form. 127/2383 useless extension candidates. Maximal degree in co-relation 10746. Up to 327 conditions per place. [2022-12-13 01:34:12,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 160 transitions, 2543 flow [2022-12-13 01:34:12,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-13 01:34:12,749 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:12,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 399 [2022-12-13 01:34:12,749 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 160 transitions, 2543 flow [2022-12-13 01:34:12,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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 01:34:12,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:12,749 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, 1] [2022-12-13 01:34:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 01:34:12,750 INFO L420 AbstractCegarLoop]: === Iteration 79 === 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 01:34:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1576590249, now seen corresponding path program 4 times [2022-12-13 01:34:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344247640] [2022-12-13 01:34:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:13,409 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 01:34:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:13,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344247640] [2022-12-13 01:34:13,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344247640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:13,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:13,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:34:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767686575] [2022-12-13 01:34:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:13,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:34:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:34:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:34:13,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:13,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 160 transitions, 2543 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:13,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:13,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:13,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:15,765 INFO L130 PetriNetUnfolder]: 6885/12693 cut-off events. [2022-12-13 01:34:15,765 INFO L131 PetriNetUnfolder]: For 205512/205512 co-relation queries the response was YES. [2022-12-13 01:34:15,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71949 conditions, 12693 events. 6885/12693 cut-off events. For 205512/205512 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 104063 event pairs, 5356 based on Foata normal form. 1/12689 useless extension candidates. Maximal degree in co-relation 71870. Up to 12548 conditions per place. [2022-12-13 01:34:15,860 INFO L137 encePairwiseOnDemand]: 47/54 looper letters, 170 selfloop transitions, 4 changer transitions 16/190 dead transitions. [2022-12-13 01:34:15,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 190 transitions, 3032 flow [2022-12-13 01:34:15,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:34:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:34:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-13 01:34:15,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20601851851851852 [2022-12-13 01:34:15,861 INFO L175 Difference]: Start difference. First operand has 170 places, 160 transitions, 2543 flow. Second operand 8 states and 89 transitions. [2022-12-13 01:34:15,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 190 transitions, 3032 flow [2022-12-13 01:34:16,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 190 transitions, 3001 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-13 01:34:16,887 INFO L231 Difference]: Finished difference. Result has 174 places, 160 transitions, 2529 flow [2022-12-13 01:34:16,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2514, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2529, PETRI_PLACES=174, PETRI_TRANSITIONS=160} [2022-12-13 01:34:16,887 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 132 predicate places. [2022-12-13 01:34:16,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:16,887 INFO L89 Accepts]: Start accepts. Operand has 174 places, 160 transitions, 2529 flow [2022-12-13 01:34:16,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:16,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:16,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 160 transitions, 2529 flow [2022-12-13 01:34:16,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 160 transitions, 2529 flow [2022-12-13 01:34:17,317 INFO L130 PetriNetUnfolder]: 347/2308 cut-off events. [2022-12-13 01:34:17,317 INFO L131 PetriNetUnfolder]: For 32812/33347 co-relation queries the response was YES. [2022-12-13 01:34:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10787 conditions, 2308 events. 347/2308 cut-off events. For 32812/33347 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 27713 event pairs, 28 based on Foata normal form. 122/2382 useless extension candidates. Maximal degree in co-relation 10716. Up to 327 conditions per place. [2022-12-13 01:34:17,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 160 transitions, 2529 flow [2022-12-13 01:34:17,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 1318 [2022-12-13 01:34:17,341 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:17,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 454 [2022-12-13 01:34:17,342 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 160 transitions, 2529 flow [2022-12-13 01:34:17,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:17,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:17,342 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, 1] [2022-12-13 01:34:17,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 01:34:17,342 INFO L420 AbstractCegarLoop]: === Iteration 80 === 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 01:34:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -239791774, now seen corresponding path program 5 times [2022-12-13 01:34:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:17,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772312946] [2022-12-13 01:34:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:17,854 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 01:34:17,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:17,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772312946] [2022-12-13 01:34:17,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772312946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:17,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:17,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:34:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513578108] [2022-12-13 01:34:17,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:17,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:34:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:17,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:34:17,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:34:17,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:17,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 160 transitions, 2529 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:17,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:17,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:17,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:20,093 INFO L130 PetriNetUnfolder]: 6855/12661 cut-off events. [2022-12-13 01:34:20,093 INFO L131 PetriNetUnfolder]: For 199835/199835 co-relation queries the response was YES. [2022-12-13 01:34:20,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71328 conditions, 12661 events. 6855/12661 cut-off events. For 199835/199835 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 104016 event pairs, 5246 based on Foata normal form. 3/12659 useless extension candidates. Maximal degree in co-relation 71248. Up to 12300 conditions per place. [2022-12-13 01:34:20,189 INFO L137 encePairwiseOnDemand]: 45/54 looper letters, 168 selfloop transitions, 17 changer transitions 9/194 dead transitions. [2022-12-13 01:34:20,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 3265 flow [2022-12-13 01:34:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:34:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:34:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2022-12-13 01:34:20,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1728395061728395 [2022-12-13 01:34:20,190 INFO L175 Difference]: Start difference. First operand has 172 places, 160 transitions, 2529 flow. Second operand 9 states and 84 transitions. [2022-12-13 01:34:20,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 3265 flow [2022-12-13 01:34:21,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 194 transitions, 3254 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 01:34:21,206 INFO L231 Difference]: Finished difference. Result has 178 places, 166 transitions, 2712 flow [2022-12-13 01:34:21,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2518, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2712, PETRI_PLACES=178, PETRI_TRANSITIONS=166} [2022-12-13 01:34:21,206 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2022-12-13 01:34:21,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:21,206 INFO L89 Accepts]: Start accepts. Operand has 178 places, 166 transitions, 2712 flow [2022-12-13 01:34:21,207 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:21,207 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:21,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 166 transitions, 2712 flow [2022-12-13 01:34:21,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 166 transitions, 2712 flow [2022-12-13 01:34:21,462 INFO L130 PetriNetUnfolder]: 344/2296 cut-off events. [2022-12-13 01:34:21,462 INFO L131 PetriNetUnfolder]: For 34235/34777 co-relation queries the response was YES. [2022-12-13 01:34:21,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10910 conditions, 2296 events. 344/2296 cut-off events. For 34235/34777 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 27576 event pairs, 28 based on Foata normal form. 128/2376 useless extension candidates. Maximal degree in co-relation 10836. Up to 324 conditions per place. [2022-12-13 01:34:21,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 166 transitions, 2712 flow [2022-12-13 01:34:21,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-13 01:34:21,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:34:22,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:34:22,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 965 [2022-12-13 01:34:22,172 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 165 transitions, 2708 flow [2022-12-13 01:34:22,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:22,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:22,172 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, 1] [2022-12-13 01:34:22,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 01:34:22,172 INFO L420 AbstractCegarLoop]: === Iteration 81 === 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 01:34:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2039694237, now seen corresponding path program 5 times [2022-12-13 01:34:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:22,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267841134] [2022-12-13 01:34:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:22,735 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 01:34:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:22,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267841134] [2022-12-13 01:34:22,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267841134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:22,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:22,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:34:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45409256] [2022-12-13 01:34:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:22,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:34:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:34:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:34:22,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 01:34:22,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 165 transitions, 2708 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:22,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:22,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 01:34:22,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:24,991 INFO L130 PetriNetUnfolder]: 6846/12618 cut-off events. [2022-12-13 01:34:24,992 INFO L131 PetriNetUnfolder]: For 203096/203096 co-relation queries the response was YES. [2022-12-13 01:34:25,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71744 conditions, 12618 events. 6846/12618 cut-off events. For 203096/203096 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 103299 event pairs, 5369 based on Foata normal form. 1/12614 useless extension candidates. Maximal degree in co-relation 71662. Up to 12524 conditions per place. [2022-12-13 01:34:25,080 INFO L137 encePairwiseOnDemand]: 48/55 looper letters, 158 selfloop transitions, 2 changer transitions 29/189 dead transitions. [2022-12-13 01:34:25,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 189 transitions, 3164 flow [2022-12-13 01:34:25,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:34:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:34:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 01:34:25,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19090909090909092 [2022-12-13 01:34:25,082 INFO L175 Difference]: Start difference. First operand has 175 places, 165 transitions, 2708 flow. Second operand 8 states and 84 transitions. [2022-12-13 01:34:25,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 189 transitions, 3164 flow [2022-12-13 01:34:26,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 189 transitions, 3139 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 01:34:26,167 INFO L231 Difference]: Finished difference. Result has 178 places, 160 transitions, 2595 flow [2022-12-13 01:34:26,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2683, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2595, PETRI_PLACES=178, PETRI_TRANSITIONS=160} [2022-12-13 01:34:26,167 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2022-12-13 01:34:26,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:26,167 INFO L89 Accepts]: Start accepts. Operand has 178 places, 160 transitions, 2595 flow [2022-12-13 01:34:26,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:26,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:26,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 160 transitions, 2595 flow [2022-12-13 01:34:26,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 160 transitions, 2595 flow [2022-12-13 01:34:26,441 INFO L130 PetriNetUnfolder]: 344/2272 cut-off events. [2022-12-13 01:34:26,441 INFO L131 PetriNetUnfolder]: For 33817/34358 co-relation queries the response was YES. [2022-12-13 01:34:26,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10777 conditions, 2272 events. 344/2272 cut-off events. For 33817/34358 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 27221 event pairs, 28 based on Foata normal form. 128/2352 useless extension candidates. Maximal degree in co-relation 10705. Up to 324 conditions per place. [2022-12-13 01:34:26,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 160 transitions, 2595 flow [2022-12-13 01:34:26,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 1312 [2022-12-13 01:34:26,475 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:26,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-13 01:34:26,476 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 160 transitions, 2595 flow [2022-12-13 01:34:26,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:26,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:26,476 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 01:34:26,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 01:34:26,476 INFO L420 AbstractCegarLoop]: === Iteration 82 === 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 01:34:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2134059754, now seen corresponding path program 1 times [2022-12-13 01:34:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:26,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966621728] [2022-12-13 01:34:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:27,044 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 01:34:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:27,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966621728] [2022-12-13 01:34:27,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966621728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:27,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:27,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:34:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581716103] [2022-12-13 01:34:27,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:27,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:34:27,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:27,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:34:27,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:34:27,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:27,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 160 transitions, 2595 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:34:27,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:27,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:27,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:29,151 INFO L130 PetriNetUnfolder]: 6812/12527 cut-off events. [2022-12-13 01:34:29,151 INFO L131 PetriNetUnfolder]: For 202599/202599 co-relation queries the response was YES. [2022-12-13 01:34:29,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71186 conditions, 12527 events. 6812/12527 cut-off events. For 202599/202599 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 102232 event pairs, 5203 based on Foata normal form. 3/12525 useless extension candidates. Maximal degree in co-relation 71106. Up to 12163 conditions per place. [2022-12-13 01:34:29,234 INFO L137 encePairwiseOnDemand]: 45/54 looper letters, 161 selfloop transitions, 13 changer transitions 14/188 dead transitions. [2022-12-13 01:34:29,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 188 transitions, 3178 flow [2022-12-13 01:34:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:34:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:34:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-13 01:34:29,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18981481481481483 [2022-12-13 01:34:29,235 INFO L175 Difference]: Start difference. First operand has 164 places, 160 transitions, 2595 flow. Second operand 8 states and 82 transitions. [2022-12-13 01:34:29,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 188 transitions, 3178 flow [2022-12-13 01:34:30,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 188 transitions, 3097 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-12-13 01:34:30,171 INFO L231 Difference]: Finished difference. Result has 163 places, 157 transitions, 2470 flow [2022-12-13 01:34:30,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2470, PETRI_PLACES=163, PETRI_TRANSITIONS=157} [2022-12-13 01:34:30,171 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2022-12-13 01:34:30,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:30,172 INFO L89 Accepts]: Start accepts. Operand has 163 places, 157 transitions, 2470 flow [2022-12-13 01:34:30,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:30,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:30,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 157 transitions, 2470 flow [2022-12-13 01:34:30,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 157 transitions, 2470 flow [2022-12-13 01:34:30,404 INFO L130 PetriNetUnfolder]: 340/2240 cut-off events. [2022-12-13 01:34:30,404 INFO L131 PetriNetUnfolder]: For 30401/30934 co-relation queries the response was YES. [2022-12-13 01:34:30,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10348 conditions, 2240 events. 340/2240 cut-off events. For 30401/30934 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 26697 event pairs, 28 based on Foata normal form. 127/2320 useless extension candidates. Maximal degree in co-relation 10280. Up to 316 conditions per place. [2022-12-13 01:34:30,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 157 transitions, 2470 flow [2022-12-13 01:34:30,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 1302 [2022-12-13 01:34:30,430 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:30,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-13 01:34:30,431 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 2470 flow [2022-12-13 01:34:30,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 01:34:30,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:30,431 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, 1] [2022-12-13 01:34:30,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 01:34:30,431 INFO L420 AbstractCegarLoop]: === Iteration 83 === 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 01:34:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1889188008, now seen corresponding path program 1 times [2022-12-13 01:34:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:30,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699820292] [2022-12-13 01:34:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:31,057 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 01:34:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:31,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699820292] [2022-12-13 01:34:31,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699820292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:31,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:31,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:34:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190272298] [2022-12-13 01:34:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:31,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:34:31,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:31,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:34:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:34:31,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:34:31,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 2470 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:34:31,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:31,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:34:31,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:33,408 INFO L130 PetriNetUnfolder]: 6902/12750 cut-off events. [2022-12-13 01:34:33,408 INFO L131 PetriNetUnfolder]: For 181611/181611 co-relation queries the response was YES. [2022-12-13 01:34:33,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70259 conditions, 12750 events. 6902/12750 cut-off events. For 181611/181611 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 105379 event pairs, 4942 based on Foata normal form. 3/12748 useless extension candidates. Maximal degree in co-relation 70183. Up to 11141 conditions per place. [2022-12-13 01:34:33,517 INFO L137 encePairwiseOnDemand]: 42/53 looper letters, 207 selfloop transitions, 17 changer transitions 22/246 dead transitions. [2022-12-13 01:34:33,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 246 transitions, 3545 flow [2022-12-13 01:34:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:34:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:34:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2022-12-13 01:34:33,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2138364779874214 [2022-12-13 01:34:33,518 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 2470 flow. Second operand 12 states and 136 transitions. [2022-12-13 01:34:33,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 246 transitions, 3545 flow [2022-12-13 01:34:34,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 246 transitions, 3505 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-13 01:34:34,652 INFO L231 Difference]: Finished difference. Result has 172 places, 161 transitions, 2562 flow [2022-12-13 01:34:34,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2436, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2562, PETRI_PLACES=172, PETRI_TRANSITIONS=161} [2022-12-13 01:34:34,652 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2022-12-13 01:34:34,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:34,652 INFO L89 Accepts]: Start accepts. Operand has 172 places, 161 transitions, 2562 flow [2022-12-13 01:34:34,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:34,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:34,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 161 transitions, 2562 flow [2022-12-13 01:34:34,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 161 transitions, 2562 flow [2022-12-13 01:34:34,904 INFO L130 PetriNetUnfolder]: 340/2294 cut-off events. [2022-12-13 01:34:34,904 INFO L131 PetriNetUnfolder]: For 31817/32371 co-relation queries the response was YES. [2022-12-13 01:34:34,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10732 conditions, 2294 events. 340/2294 cut-off events. For 31817/32371 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 27688 event pairs, 28 based on Foata normal form. 160/2403 useless extension candidates. Maximal degree in co-relation 10659. Up to 321 conditions per place. [2022-12-13 01:34:34,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 161 transitions, 2562 flow [2022-12-13 01:34:34,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 01:34:34,931 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:34,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-13 01:34:34,931 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 161 transitions, 2562 flow [2022-12-13 01:34:34,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:34:34,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:34,932 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, 1] [2022-12-13 01:34:34,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 01:34:34,932 INFO L420 AbstractCegarLoop]: === Iteration 84 === 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 01:34:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash 534626392, now seen corresponding path program 2 times [2022-12-13 01:34:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:34,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726031917] [2022-12-13 01:34:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:35,439 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 01:34:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:35,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726031917] [2022-12-13 01:34:35,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726031917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:35,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:35,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:34:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051121969] [2022-12-13 01:34:35,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:35,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:34:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:35,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:34:35,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:34:35,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:34:35,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 161 transitions, 2562 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:34:35,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:35,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:34:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:38,060 INFO L130 PetriNetUnfolder]: 7381/13665 cut-off events. [2022-12-13 01:34:38,060 INFO L131 PetriNetUnfolder]: For 200885/200885 co-relation queries the response was YES. [2022-12-13 01:34:38,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76888 conditions, 13665 events. 7381/13665 cut-off events. For 200885/200885 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 114446 event pairs, 4573 based on Foata normal form. 8/13668 useless extension candidates. Maximal degree in co-relation 76807. Up to 10860 conditions per place. [2022-12-13 01:34:38,163 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 212 selfloop transitions, 48 changer transitions 13/273 dead transitions. [2022-12-13 01:34:38,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 273 transitions, 4759 flow [2022-12-13 01:34:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:34:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:34:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-12-13 01:34:38,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-13 01:34:38,164 INFO L175 Difference]: Start difference. First operand has 170 places, 161 transitions, 2562 flow. Second operand 10 states and 106 transitions. [2022-12-13 01:34:38,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 273 transitions, 4759 flow [2022-12-13 01:34:39,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 273 transitions, 4704 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-13 01:34:39,589 INFO L231 Difference]: Finished difference. Result has 177 places, 190 transitions, 3230 flow [2022-12-13 01:34:39,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2524, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3230, PETRI_PLACES=177, PETRI_TRANSITIONS=190} [2022-12-13 01:34:39,590 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2022-12-13 01:34:39,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:39,590 INFO L89 Accepts]: Start accepts. Operand has 177 places, 190 transitions, 3230 flow [2022-12-13 01:34:39,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:39,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:39,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 190 transitions, 3230 flow [2022-12-13 01:34:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 190 transitions, 3230 flow [2022-12-13 01:34:39,899 INFO L130 PetriNetUnfolder]: 466/2677 cut-off events. [2022-12-13 01:34:39,899 INFO L131 PetriNetUnfolder]: For 41492/42078 co-relation queries the response was YES. [2022-12-13 01:34:39,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 2677 events. 466/2677 cut-off events. For 41492/42078 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 32266 event pairs, 18 based on Foata normal form. 225/2853 useless extension candidates. Maximal degree in co-relation 13677. Up to 434 conditions per place. [2022-12-13 01:34:39,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 190 transitions, 3230 flow [2022-12-13 01:34:39,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 1416 [2022-12-13 01:34:39,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:34:40,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:34:40,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 910 [2022-12-13 01:34:40,500 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 191 transitions, 3277 flow [2022-12-13 01:34:40,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:34:40,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:40,500 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, 1] [2022-12-13 01:34:40,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 01:34:40,500 INFO L420 AbstractCegarLoop]: === Iteration 85 === 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 01:34:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -467863270, now seen corresponding path program 3 times [2022-12-13 01:34:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:40,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880655760] [2022-12-13 01:34:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:40,994 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 01:34:40,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:40,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880655760] [2022-12-13 01:34:40,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880655760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:40,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:40,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:34:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437370816] [2022-12-13 01:34:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:40,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:34:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:40,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:34:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:34:40,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:40,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 191 transitions, 3277 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:34:40,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:40,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:40,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:43,852 INFO L130 PetriNetUnfolder]: 8047/15150 cut-off events. [2022-12-13 01:34:43,852 INFO L131 PetriNetUnfolder]: For 245657/245657 co-relation queries the response was YES. [2022-12-13 01:34:43,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88717 conditions, 15150 events. 8047/15150 cut-off events. For 245657/245657 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 131420 event pairs, 2950 based on Foata normal form. 8/15154 useless extension candidates. Maximal degree in co-relation 88633. Up to 5425 conditions per place. [2022-12-13 01:34:43,956 INFO L137 encePairwiseOnDemand]: 37/54 looper letters, 262 selfloop transitions, 64 changer transitions 21/347 dead transitions. [2022-12-13 01:34:43,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 347 transitions, 5736 flow [2022-12-13 01:34:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:34:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:34:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 163 transitions. [2022-12-13 01:34:43,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2515432098765432 [2022-12-13 01:34:43,957 INFO L175 Difference]: Start difference. First operand has 177 places, 191 transitions, 3277 flow. Second operand 12 states and 163 transitions. [2022-12-13 01:34:43,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 347 transitions, 5736 flow [2022-12-13 01:34:45,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 347 transitions, 5654 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-13 01:34:45,572 INFO L231 Difference]: Finished difference. Result has 188 places, 204 transitions, 3715 flow [2022-12-13 01:34:45,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3159, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3715, PETRI_PLACES=188, PETRI_TRANSITIONS=204} [2022-12-13 01:34:45,572 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places. [2022-12-13 01:34:45,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:45,572 INFO L89 Accepts]: Start accepts. Operand has 188 places, 204 transitions, 3715 flow [2022-12-13 01:34:45,574 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:45,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:45,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 204 transitions, 3715 flow [2022-12-13 01:34:45,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 204 transitions, 3715 flow [2022-12-13 01:34:45,937 INFO L130 PetriNetUnfolder]: 462/2956 cut-off events. [2022-12-13 01:34:45,938 INFO L131 PetriNetUnfolder]: For 50707/51298 co-relation queries the response was YES. [2022-12-13 01:34:45,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15273 conditions, 2956 events. 462/2956 cut-off events. For 50707/51298 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37131 event pairs, 23 based on Foata normal form. 164/3065 useless extension candidates. Maximal degree in co-relation 15194. Up to 432 conditions per place. [2022-12-13 01:34:45,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 204 transitions, 3715 flow [2022-12-13 01:34:45,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 1492 [2022-12-13 01:34:45,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1902] $Ultimate##0-->L59-2: Formula: (and (= v_~order2_14~0_252 |v_thread2Thread1of1ForFork2_#t~mem11#1_321|) (= |v_#pthreadsForks_1314| (+ |v_#pthreadsForks_1315| 1)) (= |v_#pthreadsForks_1315| |v_ULTIMATE.start_main_#t~pre50#1_576|) (= (store |v_#memory_int_1733| |v_ULTIMATE.start_main_~#t3~0#1.base_674| (store (select |v_#memory_int_1733| |v_ULTIMATE.start_main_~#t3~0#1.base_674|) |v_ULTIMATE.start_main_~#t3~0#1.offset_582| |v_ULTIMATE.start_main_#t~pre50#1_576|)) |v_#memory_int_1732|) (= v_~order1_13~0_248 (select (select |v_#memory_int_1733| v_~get_5~0.base_454) (+ v_~get_5~0.offset_443 (* v_~id_3~0_631 4)))) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_321| (select (select |v_#memory_int_1732| v_~get_8~0.base_486) (+ v_~get_8~0.offset_430 (* v_~id_6~0_552 4))))) InVars {~id_6~0=v_~id_6~0_552, #pthreadsForks=|v_#pthreadsForks_1315|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_582|, ~get_8~0.base=v_~get_8~0.base_486, ~get_5~0.base=v_~get_5~0.base_454, ~get_8~0.offset=v_~get_8~0.offset_430, #memory_int=|v_#memory_int_1733|, ~id_3~0=v_~id_3~0_631, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_674|, ~get_5~0.offset=v_~get_5~0.offset_443} OutVars{~id_6~0=v_~id_6~0_552, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_681|, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_321|, ~order1_13~0=v_~order1_13~0_248, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_582|, ~get_8~0.base=v_~get_8~0.base_486, ~get_8~0.offset=v_~get_8~0.offset_430, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_556|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_674|, #pthreadsForks=|v_#pthreadsForks_1314|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_576|, ~get_5~0.base=v_~get_5~0.base_454, #memory_int=|v_#memory_int_1732|, ~id_3~0=v_~id_3~0_631, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_425|, ~get_5~0.offset=v_~get_5~0.offset_443, ~order2_14~0=v_~order2_14~0_252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#t~mem11#1, #pthreadsForks, ~order1_13~0, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:34:46,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:34:46,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 873 [2022-12-13 01:34:46,445 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 204 transitions, 3740 flow [2022-12-13 01:34:46,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:34:46,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:46,446 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, 1] [2022-12-13 01:34:46,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 01:34:46,446 INFO L420 AbstractCegarLoop]: === Iteration 86 === 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 01:34:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1842204544, now seen corresponding path program 4 times [2022-12-13 01:34:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:46,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312299305] [2022-12-13 01:34:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:47,123 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 01:34:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:47,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312299305] [2022-12-13 01:34:47,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312299305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:47,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:47,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:34:47,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901335783] [2022-12-13 01:34:47,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:47,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:34:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:47,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:34:47,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:34:47,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:34:47,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 204 transitions, 3740 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:47,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:47,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:34:47,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:50,103 INFO L130 PetriNetUnfolder]: 7931/14931 cut-off events. [2022-12-13 01:34:50,103 INFO L131 PetriNetUnfolder]: For 286658/286658 co-relation queries the response was YES. [2022-12-13 01:34:50,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90311 conditions, 14931 events. 7931/14931 cut-off events. For 286658/286658 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 128657 event pairs, 5757 based on Foata normal form. 3/14929 useless extension candidates. Maximal degree in co-relation 90224. Up to 14087 conditions per place. [2022-12-13 01:34:50,209 INFO L137 encePairwiseOnDemand]: 43/54 looper letters, 228 selfloop transitions, 23 changer transitions 12/263 dead transitions. [2022-12-13 01:34:50,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 263 transitions, 4767 flow [2022-12-13 01:34:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:34:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:34:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-13 01:34:50,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2242798353909465 [2022-12-13 01:34:50,210 INFO L175 Difference]: Start difference. First operand has 184 places, 204 transitions, 3740 flow. Second operand 9 states and 109 transitions. [2022-12-13 01:34:50,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 263 transitions, 4767 flow [2022-12-13 01:34:51,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 263 transitions, 4617 flow, removed 44 selfloop flow, removed 8 redundant places. [2022-12-13 01:34:51,873 INFO L231 Difference]: Finished difference. Result has 189 places, 208 transitions, 3747 flow [2022-12-13 01:34:51,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3550, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3747, PETRI_PLACES=189, PETRI_TRANSITIONS=208} [2022-12-13 01:34:51,874 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2022-12-13 01:34:51,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:51,874 INFO L89 Accepts]: Start accepts. Operand has 189 places, 208 transitions, 3747 flow [2022-12-13 01:34:51,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:51,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:51,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 208 transitions, 3747 flow [2022-12-13 01:34:51,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 208 transitions, 3747 flow [2022-12-13 01:34:52,222 INFO L130 PetriNetUnfolder]: 458/2948 cut-off events. [2022-12-13 01:34:52,223 INFO L131 PetriNetUnfolder]: For 47960/48534 co-relation queries the response was YES. [2022-12-13 01:34:52,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14921 conditions, 2948 events. 458/2948 cut-off events. For 47960/48534 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 37146 event pairs, 23 based on Foata normal form. 171/3062 useless extension candidates. Maximal degree in co-relation 14841. Up to 432 conditions per place. [2022-12-13 01:34:52,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 208 transitions, 3747 flow [2022-12-13 01:34:52,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 1514 [2022-12-13 01:34:52,258 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:52,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-13 01:34:52,258 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 208 transitions, 3747 flow [2022-12-13 01:34:52,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:52,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:52,259 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, 1] [2022-12-13 01:34:52,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 01:34:52,259 INFO L420 AbstractCegarLoop]: === Iteration 87 === 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 01:34:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1098925484, now seen corresponding path program 6 times [2022-12-13 01:34:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121548135] [2022-12-13 01:34:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:52,713 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 01:34:52,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:52,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121548135] [2022-12-13 01:34:52,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121548135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:52,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:52,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:34:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542156710] [2022-12-13 01:34:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:52,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:34:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:34:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:34:52,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:34:52,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 208 transitions, 3747 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:52,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:52,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:34:52,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:34:55,665 INFO L130 PetriNetUnfolder]: 7901/14879 cut-off events. [2022-12-13 01:34:55,665 INFO L131 PetriNetUnfolder]: For 269144/269144 co-relation queries the response was YES. [2022-12-13 01:34:55,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88747 conditions, 14879 events. 7901/14879 cut-off events. For 269144/269144 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 128100 event pairs, 5897 based on Foata normal form. 3/14877 useless extension candidates. Maximal degree in co-relation 88659. Up to 14562 conditions per place. [2022-12-13 01:34:55,795 INFO L137 encePairwiseOnDemand]: 44/53 looper letters, 205 selfloop transitions, 21 changer transitions 10/236 dead transitions. [2022-12-13 01:34:55,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 236 transitions, 4433 flow [2022-12-13 01:34:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:34:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:34:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-13 01:34:55,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17819706498951782 [2022-12-13 01:34:55,796 INFO L175 Difference]: Start difference. First operand has 188 places, 208 transitions, 3747 flow. Second operand 9 states and 85 transitions. [2022-12-13 01:34:55,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 236 transitions, 4433 flow [2022-12-13 01:34:57,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 236 transitions, 4401 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 01:34:57,385 INFO L231 Difference]: Finished difference. Result has 193 places, 207 transitions, 3738 flow [2022-12-13 01:34:57,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3716, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3738, PETRI_PLACES=193, PETRI_TRANSITIONS=207} [2022-12-13 01:34:57,385 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2022-12-13 01:34:57,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:34:57,385 INFO L89 Accepts]: Start accepts. Operand has 193 places, 207 transitions, 3738 flow [2022-12-13 01:34:57,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:34:57,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:34:57,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 207 transitions, 3738 flow [2022-12-13 01:34:57,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 207 transitions, 3738 flow [2022-12-13 01:34:57,775 INFO L130 PetriNetUnfolder]: 455/2936 cut-off events. [2022-12-13 01:34:57,775 INFO L131 PetriNetUnfolder]: For 47674/48248 co-relation queries the response was YES. [2022-12-13 01:34:57,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14835 conditions, 2936 events. 455/2936 cut-off events. For 47674/48248 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 36979 event pairs, 23 based on Foata normal form. 171/3050 useless extension candidates. Maximal degree in co-relation 14755. Up to 429 conditions per place. [2022-12-13 01:34:57,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 207 transitions, 3738 flow [2022-12-13 01:34:57,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-13 01:34:57,804 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:34:57,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-13 01:34:57,805 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 207 transitions, 3738 flow [2022-12-13 01:34:57,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:57,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:34:57,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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:34:57,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 01:34:57,805 INFO L420 AbstractCegarLoop]: === Iteration 88 === 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 01:34:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:34:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash 932038010, now seen corresponding path program 5 times [2022-12-13 01:34:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:34:57,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070826069] [2022-12-13 01:34:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:34:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:34:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:34:58,366 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 01:34:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:34:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070826069] [2022-12-13 01:34:58,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070826069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:34:58,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:34:58,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:34:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904200550] [2022-12-13 01:34:58,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:34:58,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:34:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:34:58,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:34:58,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:34:58,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:34:58,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 207 transitions, 3738 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:34:58,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:34:58,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:34:58,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:01,478 INFO L130 PetriNetUnfolder]: 7895/14843 cut-off events. [2022-12-13 01:35:01,478 INFO L131 PetriNetUnfolder]: For 268632/268632 co-relation queries the response was YES. [2022-12-13 01:35:01,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88484 conditions, 14843 events. 7895/14843 cut-off events. For 268632/268632 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 127613 event pairs, 5744 based on Foata normal form. 3/14841 useless extension candidates. Maximal degree in co-relation 88396. Up to 14085 conditions per place. [2022-12-13 01:35:01,654 INFO L137 encePairwiseOnDemand]: 42/53 looper letters, 218 selfloop transitions, 20 changer transitions 19/257 dead transitions. [2022-12-13 01:35:01,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 257 transitions, 4632 flow [2022-12-13 01:35:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:35:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:35:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-13 01:35:01,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22012578616352202 [2022-12-13 01:35:01,655 INFO L175 Difference]: Start difference. First operand has 191 places, 207 transitions, 3738 flow. Second operand 9 states and 105 transitions. [2022-12-13 01:35:01,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 257 transitions, 4632 flow [2022-12-13 01:35:03,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 257 transitions, 4562 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:35:03,222 INFO L231 Difference]: Finished difference. Result has 194 places, 206 transitions, 3704 flow [2022-12-13 01:35:03,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3682, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3704, PETRI_PLACES=194, PETRI_TRANSITIONS=206} [2022-12-13 01:35:03,222 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2022-12-13 01:35:03,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:03,222 INFO L89 Accepts]: Start accepts. Operand has 194 places, 206 transitions, 3704 flow [2022-12-13 01:35:03,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:03,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:03,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 206 transitions, 3704 flow [2022-12-13 01:35:03,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 206 transitions, 3704 flow [2022-12-13 01:35:03,645 INFO L130 PetriNetUnfolder]: 455/2915 cut-off events. [2022-12-13 01:35:03,645 INFO L131 PetriNetUnfolder]: For 47416/47984 co-relation queries the response was YES. [2022-12-13 01:35:03,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14730 conditions, 2915 events. 455/2915 cut-off events. For 47416/47984 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 36549 event pairs, 23 based on Foata normal form. 168/3026 useless extension candidates. Maximal degree in co-relation 14649. Up to 428 conditions per place. [2022-12-13 01:35:03,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 206 transitions, 3704 flow [2022-12-13 01:35:03,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 1502 [2022-12-13 01:35:03,680 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:35:03,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:35:03,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:35:03,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:35:03,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 753 [2022-12-13 01:35:03,975 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 206 transitions, 3752 flow [2022-12-13 01:35:03,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:35:03,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:03,975 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, 1] [2022-12-13 01:35:03,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 01:35:03,975 INFO L420 AbstractCegarLoop]: === Iteration 89 === 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 01:35:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2083731416, now seen corresponding path program 7 times [2022-12-13 01:35:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885685254] [2022-12-13 01:35:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:04,501 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 01:35:04,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:04,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885685254] [2022-12-13 01:35:04,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885685254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:04,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:04,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:35:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747454810] [2022-12-13 01:35:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:04,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:35:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:35:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:35:04,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:35:04,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 206 transitions, 3752 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:35:04,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:04,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:35:04,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:07,227 INFO L130 PetriNetUnfolder]: 7702/14565 cut-off events. [2022-12-13 01:35:07,228 INFO L131 PetriNetUnfolder]: For 257967/257967 co-relation queries the response was YES. [2022-12-13 01:35:07,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86453 conditions, 14565 events. 7702/14565 cut-off events. For 257967/257967 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 125682 event pairs, 4872 based on Foata normal form. 16/14576 useless extension candidates. Maximal degree in co-relation 86388. Up to 11802 conditions per place. [2022-12-13 01:35:07,343 INFO L137 encePairwiseOnDemand]: 42/56 looper letters, 196 selfloop transitions, 49 changer transitions 22/267 dead transitions. [2022-12-13 01:35:07,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 267 transitions, 4985 flow [2022-12-13 01:35:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:35:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:35:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2022-12-13 01:35:07,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19047619047619047 [2022-12-13 01:35:07,344 INFO L175 Difference]: Start difference. First operand has 192 places, 206 transitions, 3752 flow. Second operand 9 states and 96 transitions. [2022-12-13 01:35:07,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 267 transitions, 4985 flow [2022-12-13 01:35:08,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 267 transitions, 4921 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-13 01:35:08,873 INFO L231 Difference]: Finished difference. Result has 197 places, 205 transitions, 3782 flow [2022-12-13 01:35:08,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3536, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3782, PETRI_PLACES=197, PETRI_TRANSITIONS=205} [2022-12-13 01:35:08,873 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2022-12-13 01:35:08,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:08,874 INFO L89 Accepts]: Start accepts. Operand has 197 places, 205 transitions, 3782 flow [2022-12-13 01:35:08,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:08,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:08,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 205 transitions, 3782 flow [2022-12-13 01:35:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 205 transitions, 3782 flow [2022-12-13 01:35:09,296 INFO L130 PetriNetUnfolder]: 435/2820 cut-off events. [2022-12-13 01:35:09,297 INFO L131 PetriNetUnfolder]: For 51203/51779 co-relation queries the response was YES. [2022-12-13 01:35:09,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15224 conditions, 2820 events. 435/2820 cut-off events. For 51203/51779 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 35109 event pairs, 23 based on Foata normal form. 169/2931 useless extension candidates. Maximal degree in co-relation 15141. Up to 419 conditions per place. [2022-12-13 01:35:09,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 205 transitions, 3782 flow [2022-12-13 01:35:09,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 1480 [2022-12-13 01:35:09,331 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:09,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 458 [2022-12-13 01:35:09,331 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 205 transitions, 3782 flow [2022-12-13 01:35:09,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:35:09,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:09,331 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, 1] [2022-12-13 01:35:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 01:35:09,331 INFO L420 AbstractCegarLoop]: === Iteration 90 === 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 01:35:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -727149059, now seen corresponding path program 1 times [2022-12-13 01:35:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733873209] [2022-12-13 01:35:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:09,936 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 01:35:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:09,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733873209] [2022-12-13 01:35:09,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733873209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:09,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:09,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:35:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109506143] [2022-12-13 01:35:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:09,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:35:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:09,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:35:09,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:35:09,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:35:09,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 205 transitions, 3782 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:35:09,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:09,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:35:09,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:12,970 INFO L130 PetriNetUnfolder]: 8004/15257 cut-off events. [2022-12-13 01:35:12,970 INFO L131 PetriNetUnfolder]: For 294854/294854 co-relation queries the response was YES. [2022-12-13 01:35:13,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93908 conditions, 15257 events. 8004/15257 cut-off events. For 294854/294854 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 133736 event pairs, 4968 based on Foata normal form. 5/15257 useless extension candidates. Maximal degree in co-relation 93817. Up to 11522 conditions per place. [2022-12-13 01:35:13,101 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 257 selfloop transitions, 49 changer transitions 15/321 dead transitions. [2022-12-13 01:35:13,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 321 transitions, 6106 flow [2022-12-13 01:35:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:35:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:35:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-12-13 01:35:13,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24691358024691357 [2022-12-13 01:35:13,102 INFO L175 Difference]: Start difference. First operand has 193 places, 205 transitions, 3782 flow. Second operand 9 states and 120 transitions. [2022-12-13 01:35:13,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 321 transitions, 6106 flow [2022-12-13 01:35:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 321 transitions, 5959 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-12-13 01:35:15,282 INFO L231 Difference]: Finished difference. Result has 196 places, 217 transitions, 4045 flow [2022-12-13 01:35:15,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4045, PETRI_PLACES=196, PETRI_TRANSITIONS=217} [2022-12-13 01:35:15,282 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2022-12-13 01:35:15,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:15,282 INFO L89 Accepts]: Start accepts. Operand has 196 places, 217 transitions, 4045 flow [2022-12-13 01:35:15,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:15,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:15,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 217 transitions, 4045 flow [2022-12-13 01:35:15,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 217 transitions, 4045 flow [2022-12-13 01:35:15,637 INFO L130 PetriNetUnfolder]: 425/2998 cut-off events. [2022-12-13 01:35:15,637 INFO L131 PetriNetUnfolder]: For 54332/54976 co-relation queries the response was YES. [2022-12-13 01:35:15,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15890 conditions, 2998 events. 425/2998 cut-off events. For 54332/54976 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 38418 event pairs, 25 based on Foata normal form. 216/3157 useless extension candidates. Maximal degree in co-relation 15808. Up to 416 conditions per place. [2022-12-13 01:35:15,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 217 transitions, 4045 flow [2022-12-13 01:35:15,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 1546 [2022-12-13 01:35:15,675 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:15,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 394 [2022-12-13 01:35:15,676 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 217 transitions, 4045 flow [2022-12-13 01:35:15,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:35:15,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:15,676 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, 1] [2022-12-13 01:35:15,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 01:35:15,676 INFO L420 AbstractCegarLoop]: === Iteration 91 === 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 01:35:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1544907414, now seen corresponding path program 6 times [2022-12-13 01:35:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:15,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106305068] [2022-12-13 01:35:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:16,244 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 01:35:16,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106305068] [2022-12-13 01:35:16,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106305068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:16,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:16,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:35:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529928286] [2022-12-13 01:35:16,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:16,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:35:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:16,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:35:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:35:16,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:35:16,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 217 transitions, 4045 flow. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:35:16,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:16,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:35:16,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:19,361 INFO L130 PetriNetUnfolder]: 7934/15121 cut-off events. [2022-12-13 01:35:19,361 INFO L131 PetriNetUnfolder]: For 298530/298530 co-relation queries the response was YES. [2022-12-13 01:35:19,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93377 conditions, 15121 events. 7934/15121 cut-off events. For 298530/298530 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 132098 event pairs, 6103 based on Foata normal form. 3/15119 useless extension candidates. Maximal degree in co-relation 93287. Up to 14825 conditions per place. [2022-12-13 01:35:19,482 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 216 selfloop transitions, 18 changer transitions 17/251 dead transitions. [2022-12-13 01:35:19,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 251 transitions, 4902 flow [2022-12-13 01:35:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:35:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:35:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2022-12-13 01:35:19,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17901234567901234 [2022-12-13 01:35:19,483 INFO L175 Difference]: Start difference. First operand has 195 places, 217 transitions, 4045 flow. Second operand 9 states and 87 transitions. [2022-12-13 01:35:19,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 251 transitions, 4902 flow [2022-12-13 01:35:21,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 251 transitions, 4856 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 01:35:21,188 INFO L231 Difference]: Finished difference. Result has 202 places, 219 transitions, 4090 flow [2022-12-13 01:35:21,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4000, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4090, PETRI_PLACES=202, PETRI_TRANSITIONS=219} [2022-12-13 01:35:21,188 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2022-12-13 01:35:21,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:21,188 INFO L89 Accepts]: Start accepts. Operand has 202 places, 219 transitions, 4090 flow [2022-12-13 01:35:21,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:21,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:21,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 219 transitions, 4090 flow [2022-12-13 01:35:21,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 219 transitions, 4090 flow [2022-12-13 01:35:21,711 INFO L130 PetriNetUnfolder]: 422/2991 cut-off events. [2022-12-13 01:35:21,712 INFO L131 PetriNetUnfolder]: For 52240/52887 co-relation queries the response was YES. [2022-12-13 01:35:21,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15532 conditions, 2991 events. 422/2991 cut-off events. For 52240/52887 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 38315 event pairs, 25 based on Foata normal form. 217/3151 useless extension candidates. Maximal degree in co-relation 15448. Up to 416 conditions per place. [2022-12-13 01:35:21,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 219 transitions, 4090 flow [2022-12-13 01:35:21,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 1550 [2022-12-13 01:35:21,754 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:21,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 566 [2022-12-13 01:35:21,754 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 219 transitions, 4090 flow [2022-12-13 01:35:21,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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 01:35:21,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:21,754 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, 1] [2022-12-13 01:35:21,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 01:35:21,754 INFO L420 AbstractCegarLoop]: === Iteration 92 === 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 01:35:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1451160787, now seen corresponding path program 2 times [2022-12-13 01:35:21,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:21,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330705895] [2022-12-13 01:35:21,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:22,298 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 01:35:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:22,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330705895] [2022-12-13 01:35:22,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330705895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:22,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:22,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:35:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731669157] [2022-12-13 01:35:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:22,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:35:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:35:22,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:35:22,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:35:22,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 219 transitions, 4090 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:35:22,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:22,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:35:22,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:25,324 INFO L130 PetriNetUnfolder]: 7964/15181 cut-off events. [2022-12-13 01:35:25,324 INFO L131 PetriNetUnfolder]: For 272965/272965 co-relation queries the response was YES. [2022-12-13 01:35:25,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91508 conditions, 15181 events. 7964/15181 cut-off events. For 272965/272965 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 133007 event pairs, 4928 based on Foata normal form. 5/15181 useless extension candidates. Maximal degree in co-relation 91416. Up to 11486 conditions per place. [2022-12-13 01:35:25,454 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 265 selfloop transitions, 46 changer transitions 10/321 dead transitions. [2022-12-13 01:35:25,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 321 transitions, 6102 flow [2022-12-13 01:35:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:35:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:35:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2022-12-13 01:35:25,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25308641975308643 [2022-12-13 01:35:25,455 INFO L175 Difference]: Start difference. First operand has 200 places, 219 transitions, 4090 flow. Second operand 9 states and 123 transitions. [2022-12-13 01:35:25,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 321 transitions, 6102 flow [2022-12-13 01:35:27,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 321 transitions, 6056 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-13 01:35:27,145 INFO L231 Difference]: Finished difference. Result has 205 places, 218 transitions, 4146 flow [2022-12-13 01:35:27,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4146, PETRI_PLACES=205, PETRI_TRANSITIONS=218} [2022-12-13 01:35:27,146 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2022-12-13 01:35:27,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:27,146 INFO L89 Accepts]: Start accepts. Operand has 205 places, 218 transitions, 4146 flow [2022-12-13 01:35:27,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:27,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:27,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 218 transitions, 4146 flow [2022-12-13 01:35:27,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 218 transitions, 4146 flow [2022-12-13 01:35:27,577 INFO L130 PetriNetUnfolder]: 422/2984 cut-off events. [2022-12-13 01:35:27,577 INFO L131 PetriNetUnfolder]: For 55498/56135 co-relation queries the response was YES. [2022-12-13 01:35:27,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15956 conditions, 2984 events. 422/2984 cut-off events. For 55498/56135 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 38228 event pairs, 23 based on Foata normal form. 215/3142 useless extension candidates. Maximal degree in co-relation 15870. Up to 415 conditions per place. [2022-12-13 01:35:27,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 218 transitions, 4146 flow [2022-12-13 01:35:27,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 1550 [2022-12-13 01:35:27,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:35:28,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:35:28,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:35:29,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [1844] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse6 (select (select |v_#memory_int_In_13| v_~get_8~0.base_In_7) (+ (* v_~id_6~0_In_13 4) v_~get_8~0.offset_In_7))) (.cse9 (select (select |v_#memory_int_In_13| v_~get_2~0.base_In_5) (+ (* v_~id_0~0_In_9 4) v_~get_2~0.offset_In_5)))) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_6| 0)) (.cse0 (= .cse9 v_~order1_16~0_Out_14)) (.cse1 (= .cse6 v_~order2_17~0_Out_14)) (.cse4 (select (select |v_#memory_int_In_13| v_~contains_key_7~0.base_In_3) (+ v_~id_6~0_In_13 v_~contains_key_7~0.offset_In_3))) (.cse5 (select (select |v_#memory_int_In_13| v_~contains_key_1~0.base_In_3) (+ v_~id_0~0_In_9 v_~contains_key_1~0.offset_In_3))) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_6| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 .cse2 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (= v_~result_15~0_Out_14 (ite (< v_~order1_16~0_Out_14 v_~order2_17~0_Out_14) (- 1) (ite (< v_~order2_17~0_Out_14 v_~order1_16~0_Out_14) 1 0))) |v_thread3Thread1of1ForFork0_#t~short23#1_89| |v_thread3Thread1of1ForFork0_#t~short23#1_90| (not (= (mod .cse4 256) 0)) (not (= (mod .cse5 256) 0))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_91|) .cse2 (= .cse6 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (let ((.cse8 (= |v_thread3Thread1of1ForFork0_#t~mem21#1_59| .cse5)) (.cse7 (= (mod |v_thread3Thread1of1ForFork0_#t~mem21#1_59| 256) 0))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| |v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|) .cse0 .cse1 .cse7 .cse8) (and .cse0 .cse1 (= |v_thread3Thread1of1ForFork0_#t~mem22#1_55| .cse4) |v_thread3Thread1of1ForFork0_#t~short23#1_92| (= (mod |v_thread3Thread1of1ForFork0_#t~mem22#1_55| 256) 0) .cse8 (not .cse7)))) .cse3 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= .cse9 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= v_~result_15~0_Out_14 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|))))) InVars {~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, ~id_6~0=v_~id_6~0_In_13, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, ~get_8~0.base=v_~get_8~0.base_In_7, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_In_3|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~id_0~0=v_~id_0~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_Out_10|, ~id_6~0=v_~id_6~0_In_13, ~get_8~0.base=v_~get_8~0.base_In_7, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_6|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_Out_6|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_Out_10|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~contains_key_1~0.base=v_~contains_key_1~0.base_In_3, ~contains_key_7~0.offset=v_~contains_key_7~0.offset_In_3, ~result_15~0=v_~result_15~0_Out_14, ~get_2~0.base=v_~get_2~0.base_In_5, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_Out_10|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_Out_6|, ~order1_16~0=v_~order1_16~0_Out_14, ~contains_key_7~0.base=v_~contains_key_7~0.base_In_3, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_Out_6|, ~get_8~0.offset=v_~get_8~0.offset_In_7, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_6|, ~get_2~0.offset=v_~get_2~0.offset_In_5, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_In_3, #memory_int=|v_#memory_int_In_13|, ~id_0~0=v_~id_0~0_In_9, ~order2_17~0=v_~order2_17~0_Out_14, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[|v_thread3Thread1of1ForFork0_#t~mem21#1_59|, |v_thread3Thread1of1ForFork0_#t~short23#1_90|, |v_thread3Thread1of1ForFork0_#t~short23#1_91|, |v_thread3Thread1of1ForFork0_#t~mem22#1_55|, |v_thread3Thread1of1ForFork0_#t~short23#1_92|, |v_thread3Thread1of1ForFork0_#t~short23#1_89|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] [2022-12-13 01:35:29,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:35:29,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2554 [2022-12-13 01:35:29,700 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 221 transitions, 4338 flow [2022-12-13 01:35:29,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 01:35:29,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:29,700 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, 1] [2022-12-13 01:35:29,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 01:35:29,701 INFO L420 AbstractCegarLoop]: === Iteration 93 === 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 01:35:29,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash 527391832, now seen corresponding path program 7 times [2022-12-13 01:35:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:29,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105106666] [2022-12-13 01:35:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:29,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:30,143 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 01:35:30,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:30,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105106666] [2022-12-13 01:35:30,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105106666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:30,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:30,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:35:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363323098] [2022-12-13 01:35:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:30,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:35:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:30,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:35:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:35:30,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 01:35:30,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 221 transitions, 4338 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:35:30,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:30,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 01:35:30,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:33,143 INFO L130 PetriNetUnfolder]: 7991/15304 cut-off events. [2022-12-13 01:35:33,143 INFO L131 PetriNetUnfolder]: For 296400/296400 co-relation queries the response was YES. [2022-12-13 01:35:33,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94535 conditions, 15304 events. 7991/15304 cut-off events. For 296400/296400 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 134810 event pairs, 5174 based on Foata normal form. 9/15308 useless extension candidates. Maximal degree in co-relation 94441. Up to 12660 conditions per place. [2022-12-13 01:35:33,271 INFO L137 encePairwiseOnDemand]: 39/57 looper letters, 218 selfloop transitions, 58 changer transitions 21/297 dead transitions. [2022-12-13 01:35:33,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 297 transitions, 5989 flow [2022-12-13 01:35:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:35:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:35:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-12-13 01:35:33,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18070175438596492 [2022-12-13 01:35:33,272 INFO L175 Difference]: Start difference. First operand has 205 places, 221 transitions, 4338 flow. Second operand 10 states and 103 transitions. [2022-12-13 01:35:33,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 297 transitions, 5989 flow [2022-12-13 01:35:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 297 transitions, 5913 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-13 01:35:35,053 INFO L231 Difference]: Finished difference. Result has 211 places, 223 transitions, 4368 flow [2022-12-13 01:35:35,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=4057, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4368, PETRI_PLACES=211, PETRI_TRANSITIONS=223} [2022-12-13 01:35:35,054 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 169 predicate places. [2022-12-13 01:35:35,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:35,054 INFO L89 Accepts]: Start accepts. Operand has 211 places, 223 transitions, 4368 flow [2022-12-13 01:35:35,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:35,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:35,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 223 transitions, 4368 flow [2022-12-13 01:35:35,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 223 transitions, 4368 flow [2022-12-13 01:35:35,411 INFO L130 PetriNetUnfolder]: 424/3019 cut-off events. [2022-12-13 01:35:35,411 INFO L131 PetriNetUnfolder]: For 58859/59490 co-relation queries the response was YES. [2022-12-13 01:35:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16513 conditions, 3019 events. 424/3019 cut-off events. For 58859/59490 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 38697 event pairs, 23 based on Foata normal form. 211/3174 useless extension candidates. Maximal degree in co-relation 16425. Up to 427 conditions per place. [2022-12-13 01:35:35,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 223 transitions, 4368 flow [2022-12-13 01:35:35,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-13 01:35:35,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:35:35,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1680] L60-6-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_15| 0) (= v_~result_12~0_49 (ite (< v_~order1_13~0_37 v_~order2_14~0_31) (- 1) (ite (< v_~order2_14~0_31 v_~order1_13~0_37) 1 0))) (= |v_thread2Thread1of1ForFork2_#res#1.offset_15| 0) |v_thread2Thread1of1ForFork2_#t~short14#1_48|) InVars {~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~short14#1=|v_thread2Thread1of1ForFork2_#t~short14#1_48|, ~order2_14~0=v_~order2_14~0_31} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_15|, ~order1_13~0=v_~order1_13~0_37, thread2Thread1of1ForFork2_#t~mem13#1=|v_thread2Thread1of1ForFork2_#t~mem13#1_29|, thread2Thread1of1ForFork2_#t~mem12#1=|v_thread2Thread1of1ForFork2_#t~mem12#1_35|, thread2Thread1of1ForFork2_#t~ret17#1=|v_thread2Thread1of1ForFork2_#t~ret17#1_31|, thread2Thread1of1ForFork2_#t~mem15#1=|v_thread2Thread1of1ForFork2_#t~mem15#1_21|, thread2Thread1of1ForFork2_#t~ite18#1=|v_thread2Thread1of1ForFork2_#t~ite18#1_33|, thread2Thread1of1ForFork2_#t~mem16#1=|v_thread2Thread1of1ForFork2_#t~mem16#1_23|, ~result_12~0=v_~result_12~0_49, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_15|, ~order2_14~0=v_~order2_14~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem13#1, thread2Thread1of1ForFork2_#t~mem12#1, thread2Thread1of1ForFork2_#t~ret17#1, thread2Thread1of1ForFork2_#t~mem15#1, thread2Thread1of1ForFork2_#t~ite18#1, thread2Thread1of1ForFork2_#t~mem16#1, ~result_12~0, thread2Thread1of1ForFork2_#t~short14#1, thread2Thread1of1ForFork2_#res#1.base] and [1832] L52-10-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_55| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_55|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_47| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) |v_thread1Thread1of1ForFork1_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|) (<= 0 (+ v_~result_9~0_77 2147483648)) (= |v_thread1Thread1of1ForFork1_minus_#res#1_47| v_~result_9~0_77) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| |v_thread1Thread1of1ForFork1_minus_~b#1_55|) (<= v_~result_9~0_77 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_29| (select (select |v_#memory_int_394| v_~get_5~0.base_75) (+ v_~get_5~0.offset_75 (* v_~id_3~0_161 4)))) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_31| |v_thread1Thread1of1ForFork1_#t~mem6#1_38|) (= |v_thread1Thread1of1ForFork1_#res#1.base_15| 0)) InVars {thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_38|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, ~get_5~0.offset=v_~get_5~0.offset_75} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_31|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_31|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_47|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_43|, ~result_9~0=v_~result_9~0_77, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_29|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_55|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_39|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~get_5~0.base=v_~get_5~0.base_75, ~id_3~0=v_~id_3~0_161, #memory_int=|v_#memory_int_394|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_61|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_41|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_15|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_47|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_55|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_15|, ~get_5~0.offset=v_~get_5~0.offset_75, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:35:35,669 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:35:35,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 616 [2022-12-13 01:35:35,670 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 223 transitions, 4400 flow [2022-12-13 01:35:35,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:35:35,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:35,670 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, 1, 1] [2022-12-13 01:35:35,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 01:35:35,670 INFO L420 AbstractCegarLoop]: === Iteration 94 === 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 01:35:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash 12477812, now seen corresponding path program 1 times [2022-12-13 01:35:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:35,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564930753] [2022-12-13 01:35:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:35,851 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 01:35:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:35,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564930753] [2022-12-13 01:35:35,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564930753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:35,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:35,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:35:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307933466] [2022-12-13 01:35:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:35,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:35:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:35,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:35:35,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:35:35,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 01:35:35,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 223 transitions, 4400 flow. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 01:35:35,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:35,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 01:35:35,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:38,907 INFO L130 PetriNetUnfolder]: 7933/15134 cut-off events. [2022-12-13 01:35:38,908 INFO L131 PetriNetUnfolder]: For 302598/302598 co-relation queries the response was YES. [2022-12-13 01:35:38,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94521 conditions, 15134 events. 7933/15134 cut-off events. For 302598/302598 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 132329 event pairs, 6137 based on Foata normal form. 1/15131 useless extension candidates. Maximal degree in co-relation 94425. Up to 14954 conditions per place. [2022-12-13 01:35:39,037 INFO L137 encePairwiseOnDemand]: 50/55 looper letters, 247 selfloop transitions, 4 changer transitions 13/264 dead transitions. [2022-12-13 01:35:39,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 264 transitions, 5110 flow [2022-12-13 01:35:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:35:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:35:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 01:35:39,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.296969696969697 [2022-12-13 01:35:39,038 INFO L175 Difference]: Start difference. First operand has 209 places, 223 transitions, 4400 flow. Second operand 6 states and 98 transitions. [2022-12-13 01:35:39,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 264 transitions, 5110 flow [2022-12-13 01:35:40,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 264 transitions, 4961 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-13 01:35:40,811 INFO L231 Difference]: Finished difference. Result has 210 places, 224 transitions, 4291 flow [2022-12-13 01:35:40,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=4257, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4291, PETRI_PLACES=210, PETRI_TRANSITIONS=224} [2022-12-13 01:35:40,812 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places. [2022-12-13 01:35:40,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:40,812 INFO L89 Accepts]: Start accepts. Operand has 210 places, 224 transitions, 4291 flow [2022-12-13 01:35:40,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:40,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:40,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 224 transitions, 4291 flow [2022-12-13 01:35:40,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 224 transitions, 4291 flow [2022-12-13 01:35:41,230 INFO L130 PetriNetUnfolder]: 424/3020 cut-off events. [2022-12-13 01:35:41,230 INFO L131 PetriNetUnfolder]: For 56460/57098 co-relation queries the response was YES. [2022-12-13 01:35:41,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16035 conditions, 3020 events. 424/3020 cut-off events. For 56460/57098 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 38730 event pairs, 23 based on Foata normal form. 226/3188 useless extension candidates. Maximal degree in co-relation 15948. Up to 427 conditions per place. [2022-12-13 01:35:41,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 224 transitions, 4291 flow [2022-12-13 01:35:41,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 1582 [2022-12-13 01:35:41,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1888] L52-->thread3EXIT: Formula: (let ((.cse1 (select (select |v_#memory_int_1449| v_~get_8~0.base_388) (+ (* v_~id_6~0_462 4) v_~get_8~0.offset_348))) (.cse0 (select (select |v_#memory_int_1449| v_~get_2~0.base_445) (+ v_~get_2~0.offset_400 (* v_~id_0~0_549 4))))) (and (= |v_thread3Thread1of1ForFork0_minus_~b#1_77| |v_thread3Thread1of1ForFork0_minus_#in~b#1_49|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_67| 2147483648)) (= v_~result_15~0_225 |v_thread3Thread1of1ForFork0_minus_#res#1_67|) (= (select (select |v_#memory_int_1449| v_~contains_key_1~0.base_377) (+ v_~id_0~0_549 v_~contains_key_1~0.offset_324)) |v_thread1Thread1of1ForFork1_#t~mem3#1_241|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_77| |v_thread3Thread1of1ForFork0_minus_#in~a#1_49|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_77|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_77| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_77|))) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.base_33| 0) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_241| 256) 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_67| 2147483647) (= |v_thread3Thread1of1ForFork0_#res#1.offset_33| 0) (= .cse0 |v_thread3Thread1of1ForFork0_minus_#in~a#1_49|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_49| .cse1) (not |v_thread1Thread1of1ForFork1_#t~short5#1_454|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_77| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_77| |v_thread3Thread1of1ForFork0_minus_#res#1_67|)) (not |v_thread3Thread1of1ForFork0_#t~short23#1_263|) (= .cse1 v_~order2_17~0_107) (= .cse0 v_~order1_16~0_105))) InVars {~id_6~0=v_~id_6~0_462, ~get_8~0.base=v_~get_8~0.base_388, ~get_8~0.offset=v_~get_8~0.offset_348, ~contains_key_1~0.base=v_~contains_key_1~0.base_377, ~get_2~0.offset=v_~get_2~0.offset_400, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_324, ~get_2~0.base=v_~get_2~0.base_445, #memory_int=|v_#memory_int_1449|, ~id_0~0=v_~id_0~0_549} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_261|, ~id_6~0=v_~id_6~0_462, ~get_8~0.base=v_~get_8~0.base_388, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_33|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_43|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_55|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_77|, ~contains_key_1~0.base=v_~contains_key_1~0.base_377, ~result_15~0=v_~result_15~0_225, ~get_2~0.base=v_~get_2~0.base_445, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_77|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_55|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_454|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_241|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_57|, ~order1_16~0=v_~order1_16~0_105, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_61|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_111|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_43|, ~get_8~0.offset=v_~get_8~0.offset_348, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_49|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_33|, ~get_2~0.offset=v_~get_2~0.offset_400, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_67|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_120|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_324, #memory_int=|v_#memory_int_1449|, ~id_0~0=v_~id_0~0_549, ~order2_17~0=v_~order2_17~0_107, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_49|} AuxVars[|v_thread3Thread1of1ForFork0_#t~short23#1_263|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:35:41,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:35:41,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-13 01:35:41,445 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 224 transitions, 4326 flow [2022-12-13 01:35:41,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 01:35:41,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:41,445 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, 1] [2022-12-13 01:35:41,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 01:35:41,445 INFO L420 AbstractCegarLoop]: === Iteration 95 === 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 01:35:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:41,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1164756850, now seen corresponding path program 1 times [2022-12-13 01:35:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:41,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618159764] [2022-12-13 01:35:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:41,846 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 01:35:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:41,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618159764] [2022-12-13 01:35:41,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618159764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:41,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:41,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:35:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426624490] [2022-12-13 01:35:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:41,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:35:41,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:35:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:35:41,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 01:35:41,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 224 transitions, 4326 flow. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 01:35:41,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:41,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 01:35:41,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:44,816 INFO L130 PetriNetUnfolder]: 7928/15117 cut-off events. [2022-12-13 01:35:44,816 INFO L131 PetriNetUnfolder]: For 286660/286660 co-relation queries the response was YES. [2022-12-13 01:35:44,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92403 conditions, 15117 events. 7928/15117 cut-off events. For 286660/286660 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 132279 event pairs, 5293 based on Foata normal form. 1/15112 useless extension candidates. Maximal degree in co-relation 92308. Up to 12985 conditions per place. [2022-12-13 01:35:44,944 INFO L137 encePairwiseOnDemand]: 43/56 looper letters, 236 selfloop transitions, 42 changer transitions 11/289 dead transitions. [2022-12-13 01:35:44,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 289 transitions, 5825 flow [2022-12-13 01:35:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:35:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:35:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-13 01:35:44,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22321428571428573 [2022-12-13 01:35:44,945 INFO L175 Difference]: Start difference. First operand has 208 places, 224 transitions, 4326 flow. Second operand 8 states and 100 transitions. [2022-12-13 01:35:44,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 289 transitions, 5825 flow [2022-12-13 01:35:46,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 289 transitions, 5817 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 01:35:46,837 INFO L231 Difference]: Finished difference. Result has 215 places, 224 transitions, 4397 flow [2022-12-13 01:35:46,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=4318, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4397, PETRI_PLACES=215, PETRI_TRANSITIONS=224} [2022-12-13 01:35:46,838 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2022-12-13 01:35:46,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:46,838 INFO L89 Accepts]: Start accepts. Operand has 215 places, 224 transitions, 4397 flow [2022-12-13 01:35:46,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:46,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:46,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 224 transitions, 4397 flow [2022-12-13 01:35:46,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 224 transitions, 4397 flow [2022-12-13 01:35:47,293 INFO L130 PetriNetUnfolder]: 424/3009 cut-off events. [2022-12-13 01:35:47,293 INFO L131 PetriNetUnfolder]: For 58518/59112 co-relation queries the response was YES. [2022-12-13 01:35:47,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16496 conditions, 3009 events. 424/3009 cut-off events. For 58518/59112 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 38571 event pairs, 23 based on Foata normal form. 169/3120 useless extension candidates. Maximal degree in co-relation 16406. Up to 426 conditions per place. [2022-12-13 01:35:47,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 224 transitions, 4397 flow [2022-12-13 01:35:47,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 1582 [2022-12-13 01:35:47,330 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:47,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-13 01:35:47,330 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 224 transitions, 4397 flow [2022-12-13 01:35:47,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 01:35:47,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:47,331 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, 1] [2022-12-13 01:35:47,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-13 01:35:47,331 INFO L420 AbstractCegarLoop]: === Iteration 96 === 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 01:35:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1712440250, now seen corresponding path program 1 times [2022-12-13 01:35:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:47,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325190081] [2022-12-13 01:35:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:47,558 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 01:35:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:47,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325190081] [2022-12-13 01:35:47,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325190081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:47,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:47,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:35:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966237668] [2022-12-13 01:35:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:47,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:35:47,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:47,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:35:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:35:47,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 01:35:47,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 224 transitions, 4397 flow. Second operand has 5 states, 4 states have (on average 6.5) 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 01:35:47,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:47,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 01:35:47,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:50,890 INFO L130 PetriNetUnfolder]: 7923/15096 cut-off events. [2022-12-13 01:35:50,890 INFO L131 PetriNetUnfolder]: For 301684/301684 co-relation queries the response was YES. [2022-12-13 01:35:50,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94128 conditions, 15096 events. 7923/15096 cut-off events. For 301684/301684 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 131705 event pairs, 6187 based on Foata normal form. 1/15092 useless extension candidates. Maximal degree in co-relation 94030. Up to 15042 conditions per place. [2022-12-13 01:35:51,021 INFO L137 encePairwiseOnDemand]: 51/55 looper letters, 222 selfloop transitions, 0 changer transitions 17/239 dead transitions. [2022-12-13 01:35:51,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 239 transitions, 4959 flow [2022-12-13 01:35:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:35:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:35:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 01:35:51,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26181818181818184 [2022-12-13 01:35:51,022 INFO L175 Difference]: Start difference. First operand has 213 places, 224 transitions, 4397 flow. Second operand 5 states and 72 transitions. [2022-12-13 01:35:51,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 239 transitions, 4959 flow [2022-12-13 01:35:52,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 239 transitions, 4873 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 01:35:52,981 INFO L231 Difference]: Finished difference. Result has 213 places, 222 transitions, 4236 flow [2022-12-13 01:35:52,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=4311, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4236, PETRI_PLACES=213, PETRI_TRANSITIONS=222} [2022-12-13 01:35:52,981 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2022-12-13 01:35:52,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:52,981 INFO L89 Accepts]: Start accepts. Operand has 213 places, 222 transitions, 4236 flow [2022-12-13 01:35:52,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:52,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:52,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 222 transitions, 4236 flow [2022-12-13 01:35:52,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 222 transitions, 4236 flow [2022-12-13 01:35:53,377 INFO L130 PetriNetUnfolder]: 424/2994 cut-off events. [2022-12-13 01:35:53,378 INFO L131 PetriNetUnfolder]: For 56307/56894 co-relation queries the response was YES. [2022-12-13 01:35:53,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16022 conditions, 2994 events. 424/2994 cut-off events. For 56307/56894 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 38218 event pairs, 23 based on Foata normal form. 159/3094 useless extension candidates. Maximal degree in co-relation 15934. Up to 426 conditions per place. [2022-12-13 01:35:53,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 222 transitions, 4236 flow [2022-12-13 01:35:53,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 1572 [2022-12-13 01:35:53,416 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:53,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 435 [2022-12-13 01:35:53,416 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 222 transitions, 4236 flow [2022-12-13 01:35:53,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) 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 01:35:53,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:53,416 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, 1] [2022-12-13 01:35:53,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 01:35:53,416 INFO L420 AbstractCegarLoop]: === Iteration 97 === 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 01:35:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash 325020897, now seen corresponding path program 1 times [2022-12-13 01:35:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:53,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133607061] [2022-12-13 01:35:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:53,811 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 01:35:53,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:53,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133607061] [2022-12-13 01:35:53,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133607061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:53,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:53,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:35:53,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64396038] [2022-12-13 01:35:53,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:53,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:35:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:53,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:35:53,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:35:53,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:35:53,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 222 transitions, 4236 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:35:53,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:53,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:35:53,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:35:56,693 INFO L130 PetriNetUnfolder]: 7901/15040 cut-off events. [2022-12-13 01:35:56,693 INFO L131 PetriNetUnfolder]: For 287965/287965 co-relation queries the response was YES. [2022-12-13 01:35:56,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92294 conditions, 15040 events. 7901/15040 cut-off events. For 287965/287965 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 131263 event pairs, 5166 based on Foata normal form. 1/15035 useless extension candidates. Maximal degree in co-relation 92198. Up to 12584 conditions per place. [2022-12-13 01:35:56,829 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 205 selfloop transitions, 61 changer transitions 8/274 dead transitions. [2022-12-13 01:35:56,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 274 transitions, 5428 flow [2022-12-13 01:35:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:35:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:35:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-13 01:35:56,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22453703703703703 [2022-12-13 01:35:56,830 INFO L175 Difference]: Start difference. First operand has 208 places, 222 transitions, 4236 flow. Second operand 8 states and 97 transitions. [2022-12-13 01:35:56,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 274 transitions, 5428 flow [2022-12-13 01:35:58,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 274 transitions, 5414 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 01:35:58,818 INFO L231 Difference]: Finished difference. Result has 214 places, 222 transitions, 4368 flow [2022-12-13 01:35:58,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4230, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4368, PETRI_PLACES=214, PETRI_TRANSITIONS=222} [2022-12-13 01:35:58,819 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places. [2022-12-13 01:35:58,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:35:58,819 INFO L89 Accepts]: Start accepts. Operand has 214 places, 222 transitions, 4368 flow [2022-12-13 01:35:58,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:35:58,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:35:58,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 222 transitions, 4368 flow [2022-12-13 01:35:58,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 222 transitions, 4368 flow [2022-12-13 01:35:59,312 INFO L130 PetriNetUnfolder]: 424/2983 cut-off events. [2022-12-13 01:35:59,312 INFO L131 PetriNetUnfolder]: For 58983/59570 co-relation queries the response was YES. [2022-12-13 01:35:59,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16497 conditions, 2983 events. 424/2983 cut-off events. For 58983/59570 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 38096 event pairs, 23 based on Foata normal form. 159/3084 useless extension candidates. Maximal degree in co-relation 16407. Up to 425 conditions per place. [2022-12-13 01:35:59,353 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 222 transitions, 4368 flow [2022-12-13 01:35:59,353 INFO L226 LiptonReduction]: Number of co-enabled transitions 1572 [2022-12-13 01:35:59,356 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:35:59,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 537 [2022-12-13 01:35:59,356 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 222 transitions, 4368 flow [2022-12-13 01:35:59,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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 01:35:59,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:35:59,356 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, 1, 1] [2022-12-13 01:35:59,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 01:35:59,357 INFO L420 AbstractCegarLoop]: === Iteration 98 === 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 01:35:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:35:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 873336680, now seen corresponding path program 2 times [2022-12-13 01:35:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:35:59,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042049049] [2022-12-13 01:35:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:35:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:35:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:35:59,738 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 01:35:59,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:35:59,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042049049] [2022-12-13 01:35:59,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042049049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:35:59,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:35:59,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:35:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931626498] [2022-12-13 01:35:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:35:59,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:35:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:35:59,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:35:59,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:35:59,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:35:59,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 222 transitions, 4368 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 01:35:59,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:35:59,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:35:59,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:02,700 INFO L130 PetriNetUnfolder]: 7896/15029 cut-off events. [2022-12-13 01:36:02,700 INFO L131 PetriNetUnfolder]: For 297732/297732 co-relation queries the response was YES. [2022-12-13 01:36:02,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94135 conditions, 15029 events. 7896/15029 cut-off events. For 297732/297732 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 132079 event pairs, 3487 based on Foata normal form. 1/15025 useless extension candidates. Maximal degree in co-relation 94037. Up to 12070 conditions per place. [2022-12-13 01:36:02,951 INFO L137 encePairwiseOnDemand]: 43/53 looper letters, 264 selfloop transitions, 40 changer transitions 14/318 dead transitions. [2022-12-13 01:36:02,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 318 transitions, 6765 flow [2022-12-13 01:36:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:36:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:36:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-12-13 01:36:02,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2668463611859838 [2022-12-13 01:36:02,952 INFO L175 Difference]: Start difference. First operand has 211 places, 222 transitions, 4368 flow. Second operand 7 states and 99 transitions. [2022-12-13 01:36:02,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 318 transitions, 6765 flow [2022-12-13 01:36:04,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 318 transitions, 6618 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 01:36:04,905 INFO L231 Difference]: Finished difference. Result has 215 places, 222 transitions, 4381 flow [2022-12-13 01:36:04,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4273, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4381, PETRI_PLACES=215, PETRI_TRANSITIONS=222} [2022-12-13 01:36:04,906 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2022-12-13 01:36:04,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:04,906 INFO L89 Accepts]: Start accepts. Operand has 215 places, 222 transitions, 4381 flow [2022-12-13 01:36:04,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:04,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:04,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 222 transitions, 4381 flow [2022-12-13 01:36:04,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 222 transitions, 4381 flow [2022-12-13 01:36:05,378 INFO L130 PetriNetUnfolder]: 423/2979 cut-off events. [2022-12-13 01:36:05,378 INFO L131 PetriNetUnfolder]: For 59897/60478 co-relation queries the response was YES. [2022-12-13 01:36:05,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16283 conditions, 2979 events. 423/2979 cut-off events. For 59897/60478 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 38036 event pairs, 23 based on Foata normal form. 154/3074 useless extension candidates. Maximal degree in co-relation 16192. Up to 425 conditions per place. [2022-12-13 01:36:05,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 222 transitions, 4381 flow [2022-12-13 01:36:05,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 1572 [2022-12-13 01:36:05,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1888] L52-->thread3EXIT: Formula: (let ((.cse1 (select (select |v_#memory_int_1449| v_~get_8~0.base_388) (+ (* v_~id_6~0_462 4) v_~get_8~0.offset_348))) (.cse0 (select (select |v_#memory_int_1449| v_~get_2~0.base_445) (+ v_~get_2~0.offset_400 (* v_~id_0~0_549 4))))) (and (= |v_thread3Thread1of1ForFork0_minus_~b#1_77| |v_thread3Thread1of1ForFork0_minus_#in~b#1_49|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_67| 2147483648)) (= v_~result_15~0_225 |v_thread3Thread1of1ForFork0_minus_#res#1_67|) (= (select (select |v_#memory_int_1449| v_~contains_key_1~0.base_377) (+ v_~id_0~0_549 v_~contains_key_1~0.offset_324)) |v_thread1Thread1of1ForFork1_#t~mem3#1_241|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_77| |v_thread3Thread1of1ForFork0_minus_#in~a#1_49|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_77|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_77| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_77|))) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.base_33| 0) (= (mod |v_thread1Thread1of1ForFork1_#t~mem3#1_241| 256) 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_67| 2147483647) (= |v_thread3Thread1of1ForFork0_#res#1.offset_33| 0) (= .cse0 |v_thread3Thread1of1ForFork0_minus_#in~a#1_49|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_49| .cse1) (not |v_thread1Thread1of1ForFork1_#t~short5#1_454|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_77| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_77| |v_thread3Thread1of1ForFork0_minus_#res#1_67|)) (not |v_thread3Thread1of1ForFork0_#t~short23#1_263|) (= .cse1 v_~order2_17~0_107) (= .cse0 v_~order1_16~0_105))) InVars {~id_6~0=v_~id_6~0_462, ~get_8~0.base=v_~get_8~0.base_388, ~get_8~0.offset=v_~get_8~0.offset_348, ~contains_key_1~0.base=v_~contains_key_1~0.base_377, ~get_2~0.offset=v_~get_2~0.offset_400, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_324, ~get_2~0.base=v_~get_2~0.base_445, #memory_int=|v_#memory_int_1449|, ~id_0~0=v_~id_0~0_549} OutVars{thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_261|, ~id_6~0=v_~id_6~0_462, ~get_8~0.base=v_~get_8~0.base_388, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_33|, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_43|, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_55|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_77|, ~contains_key_1~0.base=v_~contains_key_1~0.base_377, ~result_15~0=v_~result_15~0_225, ~get_2~0.base=v_~get_2~0.base_445, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_77|, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_55|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_454|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_241|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_57|, ~order1_16~0=v_~order1_16~0_105, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_61|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_111|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_87|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_43|, ~get_8~0.offset=v_~get_8~0.offset_348, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_49|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_33|, ~get_2~0.offset=v_~get_2~0.offset_400, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_67|, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_120|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_324, #memory_int=|v_#memory_int_1449|, ~id_0~0=v_~id_0~0_549, ~order2_17~0=v_~order2_17~0_107, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_49|} AuxVars[|v_thread3Thread1of1ForFork0_#t~short23#1_263|] AssignedVars[~order1_16~0, thread3Thread1of1ForFork0_#t~short23#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_#t~mem22#1, ~result_15~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread3Thread1of1ForFork0_#t~ret26#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1853] L52-6-->thread1EXIT: Formula: (and (not |v_thread1Thread1of1ForFork1_#t~short5#1_99|) (= v_~result_9~0_102 |v_thread1Thread1of1ForFork1_minus_#res#1_68|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (<= v_~result_9~0_102 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| (select (select |v_#memory_int_564| v_~get_5~0.base_116) (+ v_~get_5~0.offset_116 (* v_~id_3~0_216 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| (select (select |v_#memory_int_564| v_~get_2~0.base_99) (+ v_~get_2~0.offset_99 (* v_~id_0~0_189 4)))) (= (+ |v_thread1Thread1of1ForFork1_minus_#res#1_68| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (<= 0 (+ v_~result_9~0_102 2147483648)) (= |v_thread1Thread1of1ForFork1_#res#1.base_34| 0) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_48| |v_thread1Thread1of1ForFork1_minus_~b#1_74|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_50| |v_thread1Thread1of1ForFork1_minus_~a#1_74|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_74|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|)) InVars {~get_2~0.offset=v_~get_2~0.offset_99, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_99|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_50|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_54|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_80|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_68|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_62|, ~result_9~0=v_~result_9~0_102, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_48|, ~get_2~0.offset=v_~get_2~0.offset_99, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_74|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_60|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_84|, ~get_5~0.base=v_~get_5~0.base_116, ~id_3~0=v_~id_3~0_216, #memory_int=|v_#memory_int_564|, ~get_2~0.base=v_~get_2~0.base_99, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_72|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_34|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_66|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_74|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_34|, ~id_0~0=v_~id_0~0_189, ~get_5~0.offset=v_~get_5~0.offset_116, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret8#1, ~result_9~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:36:05,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:36:05,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 835 [2022-12-13 01:36:05,741 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 222 transitions, 4394 flow [2022-12-13 01:36:05,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 01:36:05,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:05,741 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, 1] [2022-12-13 01:36:05,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 01:36:05,741 INFO L420 AbstractCegarLoop]: === Iteration 99 === 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 01:36:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2037240824, now seen corresponding path program 1 times [2022-12-13 01:36:05,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:05,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673586806] [2022-12-13 01:36:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:06,084 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 01:36:06,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:06,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673586806] [2022-12-13 01:36:06,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673586806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:06,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:06,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:36:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921220376] [2022-12-13 01:36:06,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:06,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:36:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:06,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:36:06,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:36:06,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:36:06,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 222 transitions, 4394 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:36:06,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:06,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:36:06,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:09,209 INFO L130 PetriNetUnfolder]: 7880/14991 cut-off events. [2022-12-13 01:36:09,209 INFO L131 PetriNetUnfolder]: For 300697/300697 co-relation queries the response was YES. [2022-12-13 01:36:09,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93354 conditions, 14991 events. 7880/14991 cut-off events. For 300697/300697 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 131044 event pairs, 3930 based on Foata normal form. 1/14986 useless extension candidates. Maximal degree in co-relation 93255. Up to 14511 conditions per place. [2022-12-13 01:36:09,336 INFO L137 encePairwiseOnDemand]: 45/53 looper letters, 238 selfloop transitions, 18 changer transitions 14/270 dead transitions. [2022-12-13 01:36:09,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 270 transitions, 5655 flow [2022-12-13 01:36:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:36:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:36:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-13 01:36:09,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2672955974842767 [2022-12-13 01:36:09,337 INFO L175 Difference]: Start difference. First operand has 213 places, 222 transitions, 4394 flow. Second operand 6 states and 85 transitions. [2022-12-13 01:36:09,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 270 transitions, 5655 flow [2022-12-13 01:36:11,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 270 transitions, 5566 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 01:36:11,487 INFO L231 Difference]: Finished difference. Result has 215 places, 221 transitions, 4351 flow [2022-12-13 01:36:11,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4292, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4351, PETRI_PLACES=215, PETRI_TRANSITIONS=221} [2022-12-13 01:36:11,488 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2022-12-13 01:36:11,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:11,488 INFO L89 Accepts]: Start accepts. Operand has 215 places, 221 transitions, 4351 flow [2022-12-13 01:36:11,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:11,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:11,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 221 transitions, 4351 flow [2022-12-13 01:36:11,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 221 transitions, 4351 flow [2022-12-13 01:36:11,899 INFO L130 PetriNetUnfolder]: 423/2969 cut-off events. [2022-12-13 01:36:11,899 INFO L131 PetriNetUnfolder]: For 59505/60131 co-relation queries the response was YES. [2022-12-13 01:36:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16219 conditions, 2969 events. 423/2969 cut-off events. For 59505/60131 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 37845 event pairs, 23 based on Foata normal form. 217/3131 useless extension candidates. Maximal degree in co-relation 16128. Up to 425 conditions per place. [2022-12-13 01:36:11,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 221 transitions, 4351 flow [2022-12-13 01:36:11,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 1556 [2022-12-13 01:36:11,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1967] L52-->thread1EXIT: Formula: (let ((.cse0 (select (select |v_#memory_int_2396| v_~get_8~0.base_710) (+ (* v_~id_6~0_822 4) v_~get_8~0.offset_644))) (.cse1 (select (select |v_#memory_int_2396| v_~get_2~0.base_710) (+ v_~get_2~0.offset_585 (* v_~id_0~0_794 4))))) (and (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_113| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_95| |v_thread3Thread1of1ForFork0_minus_~b#1_123|) (= |v_thread1Thread1of1ForFork1_#res#1.base_246| 0) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_95| .cse0) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_113| 2147483647) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_306|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_262| |v_thread1Thread1of1ForFork1_minus_~a#1_286|) (= .cse1 v_~order1_16~0_129) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (not |v_thread3Thread1of1ForFork0_#t~short23#1_662|) (<= 0 (+ v_~result_9~0_334 2147483648)) (= v_~result_15~0_283 |v_thread3Thread1of1ForFork0_minus_#res#1_113|) (= |v_thread1Thread1of1ForFork1_minus_~b#1_286| |v_thread1Thread1of1ForFork1_minus_#in~b#1_260|) (= |v_thread3Thread1of1ForFork0_#res#1.base_57| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296| (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~a#1_286| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_286| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_286|)) 1 0)) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_123|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_123| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_123|))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_123| |v_thread3Thread1of1ForFork0_minus_#in~a#1_95|) (= .cse1 |v_thread3Thread1of1ForFork0_minus_#in~a#1_95|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_260| (select (select |v_#memory_int_2396| v_~get_5~0.base_706) (+ v_~get_5~0.offset_695 (* v_~id_3~0_948 4)))) (= (+ |v_thread3Thread1of1ForFork0_minus_#res#1_113| |v_thread3Thread1of1ForFork0_minus_~b#1_123|) |v_thread3Thread1of1ForFork0_minus_~a#1_123|) (= .cse0 v_~order2_17~0_131) (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_286| |v_thread1Thread1of1ForFork1_minus_#res#1_280|) |v_thread1Thread1of1ForFork1_minus_~a#1_286|) (= v_~result_9~0_334 |v_thread1Thread1of1ForFork1_minus_#res#1_280|) (not |v_thread1Thread1of1ForFork1_#t~short5#1_775|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_246| 0) (= (mod (select (select |v_#memory_int_2396| v_~contains_key_1~0.base_655) (+ v_~id_0~0_794 v_~contains_key_1~0.offset_526)) 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_57| 0) (<= v_~result_9~0_334 2147483647) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_262| .cse1))) InVars {~get_2~0.offset=v_~get_2~0.offset_585, ~id_6~0=v_~id_6~0_822, ~get_5~0.base=v_~get_5~0.base_706, ~get_8~0.base=v_~get_8~0.base_710, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_526, ~id_3~0=v_~id_3~0_948, #memory_int=|v_#memory_int_2396|, ~get_2~0.base=v_~get_2~0.base_710, ~get_8~0.offset=v_~get_8~0.offset_644, ~id_0~0=v_~id_0~0_794, ~get_5~0.offset=v_~get_5~0.offset_695, ~contains_key_1~0.base=v_~contains_key_1~0.base_655} OutVars{thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_479|, ~get_8~0.base=v_~get_8~0.base_710, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_57|, ~result_9~0=v_~result_9~0_334, thread3Thread1of1ForFork0_#t~mem24#1=|v_thread3Thread1of1ForFork0_#t~mem24#1_79|, ~result_15~0=v_~result_15~0_283, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_272|, ~get_2~0.base=v_~get_2~0.base_710, thread3Thread1of1ForFork0_#t~mem25#1=|v_thread3Thread1of1ForFork0_#t~mem25#1_79|, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_774|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_246|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_278|, thread3Thread1of1ForFork0_#t~ret26#1=|v_thread3Thread1of1ForFork0_#t~ret26#1_81|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, thread3Thread1of1ForFork0_#t~mem21#1=|v_thread3Thread1of1ForFork0_#t~mem21#1_227|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_133|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_280|, ~get_8~0.offset=v_~get_8~0.offset_644, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_260|, ~get_2~0.offset=v_~get_2~0.offset_585, thread3Thread1of1ForFork0_#t~mem22#1=|v_thread3Thread1of1ForFork0_#t~mem22#1_257|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_286|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_286|, ~get_5~0.offset=v_~get_5~0.offset_695, thread3Thread1of1ForFork0_#t~short23#1=|v_thread3Thread1of1ForFork0_#t~short23#1_661|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_262|, ~id_6~0=v_~id_6~0_822, thread3Thread1of1ForFork0_#t~mem19#1=|v_thread3Thread1of1ForFork0_#t~mem19#1_67|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_274|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_123|, ~contains_key_1~0.base=v_~contains_key_1~0.base_655, ~id_3~0=v_~id_3~0_948, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_123|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_429|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_246|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_306|, ~order1_16~0=v_~order1_16~0_129, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_335|, thread3Thread1of1ForFork0_#t~ite27#1=|v_thread3Thread1of1ForFork0_#t~ite27#1_85|, thread3Thread1of1ForFork0_#t~mem20#1=|v_thread3Thread1of1ForFork0_#t~mem20#1_67|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_95|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_57|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_113|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296|, ~get_5~0.base=v_~get_5~0.base_706, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_526, #memory_int=|v_#memory_int_2396|, ~id_0~0=v_~id_0~0_794, ~order2_17~0=v_~order2_17~0_131, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_95|} AuxVars[|v_thread3Thread1of1ForFork0_#t~short23#1_662|, |v_thread1Thread1of1ForFork1_#t~short5#1_775|] AssignedVars[thread3Thread1of1ForFork0_#t~short23#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_#t~mem6#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem19#1, ~result_9~0, thread1Thread1of1ForFork1_#t~ret8#1, thread3Thread1of1ForFork0_#t~mem24#1, thread3Thread1of1ForFork0_minus_~a#1, ~result_15~0, thread1Thread1of1ForFork1_#t~mem7#1, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~mem25#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ite9#1, thread3Thread1of1ForFork0_#t~ret26#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~order1_16~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem4#1, thread3Thread1of1ForFork0_#t~ite27#1, thread3Thread1of1ForFork0_#t~mem21#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_minus_#res#1, thread3Thread1of1ForFork0_#t~mem20#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~mem22#1, thread3Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_minus_~a#1, ~order2_17~0, thread3Thread1of1ForFork0_minus_#in~a#1] and [1894] $Ultimate##0-->L59-2: Formula: (and (= v_~order1_13~0_236 (select (select |v_#memory_int_1674| v_~get_5~0.base_428) (+ v_~get_5~0.offset_417 (* v_~id_3~0_601 4)))) (= v_~order2_14~0_240 |v_thread2Thread1of1ForFork2_#t~mem11#1_314|) (= (select (select |v_#memory_int_1674| v_~get_8~0.base_474) (+ (* v_~id_6~0_538 4) v_~get_8~0.offset_418)) |v_thread2Thread1of1ForFork2_#t~mem11#1_314|)) InVars {~id_6~0=v_~id_6~0_538, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, ~get_5~0.offset=v_~get_5~0.offset_417} OutVars{~id_6~0=v_~id_6~0_538, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_314|, ~order1_13~0=v_~order1_13~0_236, ~get_8~0.base=v_~get_8~0.base_474, ~get_5~0.base=v_~get_5~0.base_428, ~get_8~0.offset=v_~get_8~0.offset_418, #memory_int=|v_#memory_int_1674|, ~id_3~0=v_~id_3~0_601, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_405|, ~get_5~0.offset=v_~get_5~0.offset_417, ~order2_14~0=v_~order2_14~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem11#1, ~order1_13~0, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:36:12,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:36:12,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 773 [2022-12-13 01:36:12,262 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 220 transitions, 4339 flow [2022-12-13 01:36:12,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 01:36:12,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:12,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, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:12,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 01:36:12,262 INFO L420 AbstractCegarLoop]: === Iteration 100 === 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 01:36:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -415827289, now seen corresponding path program 1 times [2022-12-13 01:36:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:12,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492785076] [2022-12-13 01:36:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:12,532 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 01:36:12,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:12,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492785076] [2022-12-13 01:36:12,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492785076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:12,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:12,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:36:12,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424411493] [2022-12-13 01:36:12,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:12,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:36:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:36:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:36:12,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:36:12,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 220 transitions, 4339 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 01:36:12,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:12,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:36:12,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:15,493 INFO L130 PetriNetUnfolder]: 7858/14941 cut-off events. [2022-12-13 01:36:15,493 INFO L131 PetriNetUnfolder]: For 298537/298537 co-relation queries the response was YES. [2022-12-13 01:36:15,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92908 conditions, 14941 events. 7858/14941 cut-off events. For 298537/298537 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 129870 event pairs, 6131 based on Foata normal form. 1/14936 useless extension candidates. Maximal degree in co-relation 92809. Up to 14906 conditions per place. [2022-12-13 01:36:15,614 INFO L137 encePairwiseOnDemand]: 50/53 looper letters, 219 selfloop transitions, 0 changer transitions 14/233 dead transitions. [2022-12-13 01:36:15,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 233 transitions, 4859 flow [2022-12-13 01:36:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:36:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:36:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 01:36:15,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3160377358490566 [2022-12-13 01:36:15,615 INFO L175 Difference]: Start difference. First operand has 212 places, 220 transitions, 4339 flow. Second operand 4 states and 67 transitions. [2022-12-13 01:36:15,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 233 transitions, 4859 flow [2022-12-13 01:36:17,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 233 transitions, 4755 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:36:17,610 INFO L231 Difference]: Finished difference. Result has 209 places, 219 transitions, 4190 flow [2022-12-13 01:36:17,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4236, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4190, PETRI_PLACES=209, PETRI_TRANSITIONS=219} [2022-12-13 01:36:17,610 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2022-12-13 01:36:17,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:17,611 INFO L89 Accepts]: Start accepts. Operand has 209 places, 219 transitions, 4190 flow [2022-12-13 01:36:17,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:17,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:17,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 219 transitions, 4190 flow [2022-12-13 01:36:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 219 transitions, 4190 flow [2022-12-13 01:36:18,013 INFO L130 PetriNetUnfolder]: 423/2957 cut-off events. [2022-12-13 01:36:18,014 INFO L131 PetriNetUnfolder]: For 55917/56542 co-relation queries the response was YES. [2022-12-13 01:36:18,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16121 conditions, 2957 events. 423/2957 cut-off events. For 55917/56542 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 37607 event pairs, 23 based on Foata normal form. 217/3119 useless extension candidates. Maximal degree in co-relation 16036. Up to 425 conditions per place. [2022-12-13 01:36:18,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 219 transitions, 4190 flow [2022-12-13 01:36:18,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 1548 [2022-12-13 01:36:18,044 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:36:18,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 434 [2022-12-13 01:36:18,045 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 219 transitions, 4190 flow [2022-12-13 01:36:18,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 01:36:18,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:18,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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:36:18,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 01:36:18,045 INFO L420 AbstractCegarLoop]: === Iteration 101 === 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 01:36:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2059390555, now seen corresponding path program 1 times [2022-12-13 01:36:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:18,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606540218] [2022-12-13 01:36:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:18,184 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 01:36:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:18,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606540218] [2022-12-13 01:36:18,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606540218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:18,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:18,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:36:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090704131] [2022-12-13 01:36:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:18,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:36:18,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:18,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:36:18,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:36:18,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:36:18,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 219 transitions, 4190 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 01:36:18,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:18,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:36:18,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:21,613 INFO L130 PetriNetUnfolder]: 9490/18977 cut-off events. [2022-12-13 01:36:21,613 INFO L131 PetriNetUnfolder]: For 333535/333535 co-relation queries the response was YES. [2022-12-13 01:36:21,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118620 conditions, 18977 events. 9490/18977 cut-off events. For 333535/333535 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 181312 event pairs, 4406 based on Foata normal form. 149/19120 useless extension candidates. Maximal degree in co-relation 118527. Up to 10311 conditions per place. [2022-12-13 01:36:21,901 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 287 selfloop transitions, 85 changer transitions 26/398 dead transitions. [2022-12-13 01:36:21,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 398 transitions, 8418 flow [2022-12-13 01:36:21,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:36:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:36:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 01:36:21,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4076923076923077 [2022-12-13 01:36:21,903 INFO L175 Difference]: Start difference. First operand has 204 places, 219 transitions, 4190 flow. Second operand 5 states and 106 transitions. [2022-12-13 01:36:21,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 398 transitions, 8418 flow [2022-12-13 01:36:24,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 398 transitions, 8410 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:36:24,929 INFO L231 Difference]: Finished difference. Result has 210 places, 260 transitions, 5467 flow [2022-12-13 01:36:24,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=4186, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5467, PETRI_PLACES=210, PETRI_TRANSITIONS=260} [2022-12-13 01:36:24,929 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places. [2022-12-13 01:36:24,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:24,929 INFO L89 Accepts]: Start accepts. Operand has 210 places, 260 transitions, 5467 flow [2022-12-13 01:36:24,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:24,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:24,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 260 transitions, 5467 flow [2022-12-13 01:36:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 260 transitions, 5467 flow [2022-12-13 01:36:25,516 INFO L130 PetriNetUnfolder]: 615/4551 cut-off events. [2022-12-13 01:36:25,516 INFO L131 PetriNetUnfolder]: For 84776/85492 co-relation queries the response was YES. [2022-12-13 01:36:25,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26365 conditions, 4551 events. 615/4551 cut-off events. For 84776/85492 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 63510 event pairs, 41 based on Foata normal form. 218/4696 useless extension candidates. Maximal degree in co-relation 26278. Up to 638 conditions per place. [2022-12-13 01:36:25,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 260 transitions, 5467 flow [2022-12-13 01:36:25,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 1604 [2022-12-13 01:36:25,714 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:36:25,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 786 [2022-12-13 01:36:25,715 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 260 transitions, 5467 flow [2022-12-13 01:36:25,715 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 01:36:25,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:25,715 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, 1, 1] [2022-12-13 01:36:25,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 01:36:25,715 INFO L420 AbstractCegarLoop]: === Iteration 102 === 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 01:36:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1876735289, now seen corresponding path program 2 times [2022-12-13 01:36:25,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:25,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786352841] [2022-12-13 01:36:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:25,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:25,841 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 01:36:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786352841] [2022-12-13 01:36:25,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786352841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:25,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:25,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:36:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206816917] [2022-12-13 01:36:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:25,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:36:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:36:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:36:25,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:36:25,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 260 transitions, 5467 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 01:36:25,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:25,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:36:25,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:30,003 INFO L130 PetriNetUnfolder]: 10630/20968 cut-off events. [2022-12-13 01:36:30,003 INFO L131 PetriNetUnfolder]: For 429057/429057 co-relation queries the response was YES. [2022-12-13 01:36:30,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140924 conditions, 20968 events. 10630/20968 cut-off events. For 429057/429057 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 200546 event pairs, 5338 based on Foata normal form. 66/21028 useless extension candidates. Maximal degree in co-relation 140829. Up to 14785 conditions per place. [2022-12-13 01:36:30,191 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 322 selfloop transitions, 83 changer transitions 6/411 dead transitions. [2022-12-13 01:36:30,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 411 transitions, 9276 flow [2022-12-13 01:36:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:36:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:36:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-13 01:36:30,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47596153846153844 [2022-12-13 01:36:30,192 INFO L175 Difference]: Start difference. First operand has 210 places, 260 transitions, 5467 flow. Second operand 4 states and 99 transitions. [2022-12-13 01:36:30,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 411 transitions, 9276 flow [2022-12-13 01:36:34,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 411 transitions, 9210 flow, removed 33 selfloop flow, removed 0 redundant places. [2022-12-13 01:36:34,096 INFO L231 Difference]: Finished difference. Result has 216 places, 311 transitions, 7105 flow [2022-12-13 01:36:34,096 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=5427, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7105, PETRI_PLACES=216, PETRI_TRANSITIONS=311} [2022-12-13 01:36:34,096 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2022-12-13 01:36:34,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:34,096 INFO L89 Accepts]: Start accepts. Operand has 216 places, 311 transitions, 7105 flow [2022-12-13 01:36:34,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:34,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:34,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 311 transitions, 7105 flow [2022-12-13 01:36:34,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 311 transitions, 7105 flow [2022-12-13 01:36:34,834 INFO L130 PetriNetUnfolder]: 740/4886 cut-off events. [2022-12-13 01:36:34,834 INFO L131 PetriNetUnfolder]: For 106385/107207 co-relation queries the response was YES. [2022-12-13 01:36:34,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31136 conditions, 4886 events. 740/4886 cut-off events. For 106385/107207 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 67837 event pairs, 32 based on Foata normal form. 274/5079 useless extension candidates. Maximal degree in co-relation 31046. Up to 727 conditions per place. [2022-12-13 01:36:34,898 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 311 transitions, 7105 flow [2022-12-13 01:36:34,898 INFO L226 LiptonReduction]: Number of co-enabled transitions 1734 [2022-12-13 01:36:34,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:34,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:34,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1666] L101-4-->L102-3: Formula: (and (= |v_#pthreadsForks_54| (+ |v_#pthreadsForks_55| 1)) (= |v_#pthreadsForks_55| |v_ULTIMATE.start_main_#t~pre48#1_41|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_251| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre48#1_41|)) |v_#memory_int_250|)) InVars {#pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_41|, #pthreadsForks=|v_#pthreadsForks_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_9|, #memory_int=|v_#memory_int_250|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-13 01:36:35,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1902] $Ultimate##0-->L59-2: Formula: (and (= v_~order2_14~0_252 |v_thread2Thread1of1ForFork2_#t~mem11#1_321|) (= |v_#pthreadsForks_1314| (+ |v_#pthreadsForks_1315| 1)) (= |v_#pthreadsForks_1315| |v_ULTIMATE.start_main_#t~pre50#1_576|) (= (store |v_#memory_int_1733| |v_ULTIMATE.start_main_~#t3~0#1.base_674| (store (select |v_#memory_int_1733| |v_ULTIMATE.start_main_~#t3~0#1.base_674|) |v_ULTIMATE.start_main_~#t3~0#1.offset_582| |v_ULTIMATE.start_main_#t~pre50#1_576|)) |v_#memory_int_1732|) (= v_~order1_13~0_248 (select (select |v_#memory_int_1733| v_~get_5~0.base_454) (+ v_~get_5~0.offset_443 (* v_~id_3~0_631 4)))) (= |v_thread2Thread1of1ForFork2_#t~mem11#1_321| (select (select |v_#memory_int_1732| v_~get_8~0.base_486) (+ v_~get_8~0.offset_430 (* v_~id_6~0_552 4))))) InVars {~id_6~0=v_~id_6~0_552, #pthreadsForks=|v_#pthreadsForks_1315|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_582|, ~get_8~0.base=v_~get_8~0.base_486, ~get_5~0.base=v_~get_5~0.base_454, ~get_8~0.offset=v_~get_8~0.offset_430, #memory_int=|v_#memory_int_1733|, ~id_3~0=v_~id_3~0_631, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_674|, ~get_5~0.offset=v_~get_5~0.offset_443} OutVars{~id_6~0=v_~id_6~0_552, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_681|, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_321|, ~order1_13~0=v_~order1_13~0_248, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_582|, ~get_8~0.base=v_~get_8~0.base_486, ~get_8~0.offset=v_~get_8~0.offset_430, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_556|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_674|, #pthreadsForks=|v_#pthreadsForks_1314|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_576|, ~get_5~0.base=v_~get_5~0.base_454, #memory_int=|v_#memory_int_1732|, ~id_3~0=v_~id_3~0_631, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_425|, ~get_5~0.offset=v_~get_5~0.offset_443, ~order2_14~0=v_~order2_14~0_252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#t~mem11#1, #pthreadsForks, ~order1_13~0, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:36:35,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:35,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:35,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:35,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1946] $Ultimate##0-->L59-2: Formula: (and (= (select (select |v_#memory_int_2057| v_~get_8~0.base_608) (+ (* v_~id_6~0_685 4) v_~get_8~0.offset_550)) |v_thread2Thread1of1ForFork2_#t~mem11#1_395|) (= (store |v_#memory_int_2058| |v_ULTIMATE.start_main_~#t3~0#1.base_823| (store (select |v_#memory_int_2058| |v_ULTIMATE.start_main_~#t3~0#1.base_823|) |v_ULTIMATE.start_main_~#t3~0#1.offset_716| |v_ULTIMATE.start_main_#t~pre50#1_710|)) |v_#memory_int_2057|) (= v_~order1_13~0_342 (select (select |v_#memory_int_2058| v_~get_5~0.base_590) (+ (* v_~id_3~0_800 4) v_~get_5~0.offset_579))) (= |v_#pthreadsForks_1582| (+ |v_#pthreadsForks_1583| 1)) (= v_~order2_14~0_346 |v_thread2Thread1of1ForFork2_#t~mem11#1_395|) (= |v_#pthreadsForks_1583| |v_ULTIMATE.start_main_#t~pre50#1_710|)) InVars {~id_6~0=v_~id_6~0_685, #pthreadsForks=|v_#pthreadsForks_1583|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_716|, ~get_8~0.base=v_~get_8~0.base_608, ~get_5~0.base=v_~get_5~0.base_590, ~get_8~0.offset=v_~get_8~0.offset_550, #memory_int=|v_#memory_int_2058|, ~id_3~0=v_~id_3~0_800, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_823|, ~get_5~0.offset=v_~get_5~0.offset_579} OutVars{~id_6~0=v_~id_6~0_685, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_815|, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_395|, ~order1_13~0=v_~order1_13~0_342, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_716|, ~get_8~0.base=v_~get_8~0.base_608, ~get_8~0.offset=v_~get_8~0.offset_550, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_690|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_823|, #pthreadsForks=|v_#pthreadsForks_1582|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_710|, ~get_5~0.base=v_~get_5~0.base_590, #memory_int=|v_#memory_int_2057|, ~id_3~0=v_~id_3~0_800, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_489|, ~get_5~0.offset=v_~get_5~0.offset_579, ~order2_14~0=v_~order2_14~0_346} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#t~mem11#1, #pthreadsForks, ~order1_13~0, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:36:35,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:35,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:35,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:35,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1632] L102-4-->L103-3: Formula: (and (= |v_#pthreadsForks_51| |v_ULTIMATE.start_main_#t~pre50#1_25|) (= |v_#pthreadsForks_50| (+ |v_#pthreadsForks_51| 1)) (= (store |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre50#1_25|)) |v_#memory_int_232|)) InVars {#pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_39|, #pthreadsForks=|v_#pthreadsForks_50|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_25|, #memory_int=|v_#memory_int_232|, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_7|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~pre50#1, #memory_int, ULTIMATE.start_main_#t~nondet49#1] [2022-12-13 01:36:35,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1787] L52-6-->thread1EXIT: Formula: (and |v_thread1Thread1of1ForFork1_#t~short5#1_56| (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= (ite (< v_~order1_10~0_49 v_~order2_11~0_59) (- 1) (ite (< v_~order2_11~0_59 v_~order1_10~0_49) 1 0)) v_~result_9~0_63)) InVars {~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~short5#1=|v_thread1Thread1of1ForFork1_#t~short5#1_56|, ~order1_10~0=v_~order1_10~0_49} OutVars{~order2_11~0=v_~order2_11~0_59, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_29|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_29|, thread1Thread1of1ForFork1_#t~mem7#1=|v_thread1Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_39|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_41|, thread1Thread1of1ForFork1_#t~ite9#1=|v_thread1Thread1of1ForFork1_#t~ite9#1_45|, ~result_9~0=v_~result_9~0_63, ~order1_10~0=v_~order1_10~0_49, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_#t~ite9#1, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base] and [1905] $Ultimate##0-->L59-2: Formula: (and (= (select (select |v_#memory_int_1744| v_~get_8~0.base_492) (+ (* v_~id_6~0_558 4) v_~get_8~0.offset_436)) |v_thread2Thread1of1ForFork2_#t~mem11#1_327|) (= v_~order2_14~0_258 |v_thread2Thread1of1ForFork2_#t~mem11#1_327|) (= (store |v_#memory_int_1745| |v_ULTIMATE.start_main_~#t3~0#1.base_680| (store (select |v_#memory_int_1745| |v_ULTIMATE.start_main_~#t3~0#1.base_680|) |v_ULTIMATE.start_main_~#t3~0#1.offset_588| |v_ULTIMATE.start_main_#t~pre50#1_582|)) |v_#memory_int_1744|) (= |v_#pthreadsForks_1327| |v_ULTIMATE.start_main_#t~pre50#1_582|) (= |v_#pthreadsForks_1326| (+ |v_#pthreadsForks_1327| 1)) (= v_~order1_13~0_254 (select (select |v_#memory_int_1745| v_~get_5~0.base_460) (+ v_~get_5~0.offset_449 (* v_~id_3~0_637 4))))) InVars {~id_6~0=v_~id_6~0_558, #pthreadsForks=|v_#pthreadsForks_1327|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_588|, ~get_8~0.base=v_~get_8~0.base_492, ~get_5~0.base=v_~get_5~0.base_460, ~get_8~0.offset=v_~get_8~0.offset_436, #memory_int=|v_#memory_int_1745|, ~id_3~0=v_~id_3~0_637, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_680|, ~get_5~0.offset=v_~get_5~0.offset_449} OutVars{~id_6~0=v_~id_6~0_558, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_687|, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_327|, ~order1_13~0=v_~order1_13~0_254, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_588|, ~get_8~0.base=v_~get_8~0.base_492, ~get_8~0.offset=v_~get_8~0.offset_436, ULTIMATE.start_main_#t~nondet49#1=|v_ULTIMATE.start_main_#t~nondet49#1_562|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_680|, #pthreadsForks=|v_#pthreadsForks_1326|, ULTIMATE.start_main_#t~pre50#1=|v_ULTIMATE.start_main_#t~pre50#1_582|, ~get_5~0.base=v_~get_5~0.base_460, #memory_int=|v_#memory_int_1744|, ~id_3~0=v_~id_3~0_637, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_437|, ~get_5~0.offset=v_~get_5~0.offset_449, ~order2_14~0=v_~order2_14~0_258} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, thread2Thread1of1ForFork2_#t~mem11#1, #pthreadsForks, ~order1_13~0, ULTIMATE.start_main_#t~pre50#1, ULTIMATE.start_main_#t~nondet49#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, ~order2_14~0] [2022-12-13 01:36:35,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:36:35,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1358 [2022-12-13 01:36:35,454 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 310 transitions, 7217 flow [2022-12-13 01:36:35,454 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 01:36:35,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:35,454 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, 1, 1] [2022-12-13 01:36:35,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 01:36:35,454 INFO L420 AbstractCegarLoop]: === Iteration 103 === 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 01:36:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1447712232, now seen corresponding path program 1 times [2022-12-13 01:36:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:35,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983092236] [2022-12-13 01:36:35,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:35,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:35,802 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 01:36:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:35,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983092236] [2022-12-13 01:36:35,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983092236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:35,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:35,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:36:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845548123] [2022-12-13 01:36:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:35,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:36:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:36:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:36:35,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-13 01:36:35,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 310 transitions, 7217 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 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 01:36:35,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:35,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-13 01:36:35,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:36:40,284 INFO L130 PetriNetUnfolder]: 9738/19362 cut-off events. [2022-12-13 01:36:40,284 INFO L131 PetriNetUnfolder]: For 434691/434691 co-relation queries the response was YES. [2022-12-13 01:36:40,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137813 conditions, 19362 events. 9738/19362 cut-off events. For 434691/434691 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 184260 event pairs, 4287 based on Foata normal form. 2/19358 useless extension candidates. Maximal degree in co-relation 137715. Up to 12932 conditions per place. [2022-12-13 01:36:40,463 INFO L137 encePairwiseOnDemand]: 43/65 looper letters, 357 selfloop transitions, 77 changer transitions 13/447 dead transitions. [2022-12-13 01:36:40,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 447 transitions, 10124 flow [2022-12-13 01:36:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:36:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:36:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-13 01:36:40,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2519230769230769 [2022-12-13 01:36:40,464 INFO L175 Difference]: Start difference. First operand has 215 places, 310 transitions, 7217 flow. Second operand 8 states and 131 transitions. [2022-12-13 01:36:40,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 447 transitions, 10124 flow [2022-12-13 01:36:44,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 447 transitions, 9965 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-13 01:36:44,360 INFO L231 Difference]: Finished difference. Result has 226 places, 318 transitions, 7552 flow [2022-12-13 01:36:44,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=7079, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7552, PETRI_PLACES=226, PETRI_TRANSITIONS=318} [2022-12-13 01:36:44,361 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places. [2022-12-13 01:36:44,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:36:44,361 INFO L89 Accepts]: Start accepts. Operand has 226 places, 318 transitions, 7552 flow [2022-12-13 01:36:44,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:36:44,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:36:44,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 318 transitions, 7552 flow [2022-12-13 01:36:44,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 318 transitions, 7552 flow [2022-12-13 01:36:45,070 INFO L130 PetriNetUnfolder]: 740/4663 cut-off events. [2022-12-13 01:36:45,070 INFO L131 PetriNetUnfolder]: For 105348/105901 co-relation queries the response was YES. [2022-12-13 01:36:45,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31318 conditions, 4663 events. 740/4663 cut-off events. For 105348/105901 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 63587 event pairs, 26 based on Foata normal form. 270/4875 useless extension candidates. Maximal degree in co-relation 31221. Up to 727 conditions per place. [2022-12-13 01:36:45,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 318 transitions, 7552 flow [2022-12-13 01:36:45,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-13 01:36:45,142 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:36:45,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 781 [2022-12-13 01:36:45,142 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 318 transitions, 7552 flow [2022-12-13 01:36:45,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 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 01:36:45,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:36:45,142 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, 1, 1] [2022-12-13 01:36:45,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 01:36:45,142 INFO L420 AbstractCegarLoop]: === Iteration 104 === 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 01:36:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:36:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -136699777, now seen corresponding path program 1 times [2022-12-13 01:36:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:36:45,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210232231] [2022-12-13 01:36:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:36:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:36:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:36:45,758 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 01:36:45,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:36:45,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210232231] [2022-12-13 01:36:45,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210232231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:36:45,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:36:45,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 01:36:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403442145] [2022-12-13 01:36:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:36:45,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:36:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:36:45,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:36:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:36:45,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-13 01:36:45,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 318 transitions, 7552 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 01:36:45,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:36:45,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-13 01:36:45,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand