/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:14:32,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:14:32,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:14:32,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:14:32,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:14:32,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:14:32,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:14:32,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:14:32,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:14:32,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:14:32,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:14:32,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:14:32,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:14:32,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:14:32,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:14:32,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:14:32,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:14:32,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:14:32,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:14:32,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:14:32,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:14:32,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:14:32,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:14:32,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:14:32,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:14:32,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:14:32,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:14:32,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:14:32,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:14:32,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:14:32,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:14:32,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:14:32,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:14:32,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:14:32,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:14:32,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:14:32,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:14:32,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:14:32,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:14:32,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:14:32,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:14:32,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:14:32,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:14:32,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:14:32,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:14:32,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:14:32,379 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:14:32,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:14:32,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:14:32,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:14:32,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:14:32,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:14:32,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:14:32,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:14:32,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:14:32,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:14:32,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:14:32,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:14:32,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:14:32,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:14:32,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:14:32,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:14:32,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:14:32,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:14:32,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:14:32,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:14:32,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:14:32,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:14:32,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:14:32,381 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:14:32,381 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-06 07:14:32,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:14:32,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:14:32,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:14:32,622 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:14:32,624 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:14:32,624 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-06 07:14:33,522 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:14:33,673 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:14:33,673 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-06 07:14:33,679 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e9736fe/2ea498b53cf9497eaaccdf723652531a/FLAGa8d421d9d [2022-12-06 07:14:33,698 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e9736fe/2ea498b53cf9497eaaccdf723652531a [2022-12-06 07:14:33,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:14:33,701 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:14:33,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:14:33,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:14:33,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:14:33,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a64746c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33, skipping insertion in model container [2022-12-06 07:14:33,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:14:33,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:14:33,873 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-chromosome-symm.wvr.c[2695,2708] [2022-12-06 07:14:33,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:14:33,885 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:14:33,902 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-chromosome-symm.wvr.c[2695,2708] [2022-12-06 07:14:33,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:14:33,920 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:14:33,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33 WrapperNode [2022-12-06 07:14:33,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:14:33,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:14:33,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:14:33,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:14:33,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,966 INFO L138 Inliner]: procedures = 25, calls = 37, calls flagged for inlining = 15, calls inlined = 19, statements flattened = 194 [2022-12-06 07:14:33,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:14:33,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:14:33,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:14:33,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:14:33,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,983 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:14:33,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:14:33,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:14:33,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:14:33,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (1/1) ... [2022-12-06 07:14:33,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:14:34,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:34,008 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-06 07:14:34,014 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-06 07:14:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:14:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:14:34,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:14:34,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:14:34,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:14:34,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:14:34,041 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:14:34,113 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:14:34,114 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:14:34,447 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:14:34,459 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:14:34,460 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:14:34,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:14:34 BoogieIcfgContainer [2022-12-06 07:14:34,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:14:34,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:14:34,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:14:34,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:14:34,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:14:33" (1/3) ... [2022-12-06 07:14:34,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6335438c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:14:34, skipping insertion in model container [2022-12-06 07:14:34,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:14:33" (2/3) ... [2022-12-06 07:14:34,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6335438c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:14:34, skipping insertion in model container [2022-12-06 07:14:34,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:14:34" (3/3) ... [2022-12-06 07:14:34,466 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2022-12-06 07:14:34,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:14:34,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:14:34,483 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:14:34,564 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:14:34,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 07:14:34,689 INFO L130 PetriNetUnfolder]: 21/225 cut-off events. [2022-12-06 07:14:34,689 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:14:34,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 225 events. 21/225 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 261 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-06 07:14:34,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 07:14:34,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 217 transitions, 446 flow [2022-12-06 07:14:34,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:34,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 07:14:34,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 217 transitions, 446 flow [2022-12-06 07:14:34,772 INFO L130 PetriNetUnfolder]: 21/217 cut-off events. [2022-12-06 07:14:34,772 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:14:34,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 217 events. 21/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 260 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-06 07:14:34,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 07:14:34,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 5400 [2022-12-06 07:14:39,886 INFO L203 LiptonReduction]: Total number of compositions: 197 [2022-12-06 07:14:39,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:14:39,900 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;@7fc8623a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:14:39,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:14:39,904 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-06 07:14:39,904 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:14:39,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:39,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:39,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1077272917, now seen corresponding path program 1 times [2022-12-06 07:14:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:39,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923017769] [2022-12-06 07:14:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:39,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:40,166 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-06 07:14:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923017769] [2022-12-06 07:14:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923017769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:14:40,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:14:40,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:14:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144756493] [2022-12-06 07:14:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:14:40,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:14:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:14:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:14:40,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:14:40,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:40,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:40,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:14:40,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:40,252 INFO L130 PetriNetUnfolder]: 53/98 cut-off events. [2022-12-06 07:14:40,252 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 07:14:40,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 98 events. 53/98 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 33 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 160. Up to 97 conditions per place. [2022-12-06 07:14:40,254 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2022-12-06 07:14:40,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 100 flow [2022-12-06 07:14:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:14:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:14:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 07:14:40,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:14:40,262 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 24 transitions. [2022-12-06 07:14:40,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 100 flow [2022-12-06 07:14:40,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:14:40,265 INFO L231 Difference]: Finished difference. Result has 22 places, 22 transitions, 66 flow [2022-12-06 07:14:40,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=22} [2022-12-06 07:14:40,268 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2022-12-06 07:14:40,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:40,269 INFO L89 Accepts]: Start accepts. Operand has 22 places, 22 transitions, 66 flow [2022-12-06 07:14:40,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:40,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:40,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 22 transitions, 66 flow [2022-12-06 07:14:40,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 22 transitions, 66 flow [2022-12-06 07:14:40,275 INFO L130 PetriNetUnfolder]: 4/22 cut-off events. [2022-12-06 07:14:40,276 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:14:40,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 4/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 16 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 21. Up to 6 conditions per place. [2022-12-06 07:14:40,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 22 transitions, 66 flow [2022-12-06 07:14:40,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 07:14:40,282 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:14:40,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:14:40,283 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 22 transitions, 66 flow [2022-12-06 07:14:40,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:40,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:40,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:40,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:14:40,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash 639991075, now seen corresponding path program 1 times [2022-12-06 07:14:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:40,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033161222] [2022-12-06 07:14:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:14:40,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:40,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033161222] [2022-12-06 07:14:40,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033161222] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:14:40,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231220834] [2022-12-06 07:14:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:40,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:14:40,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:14:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:40,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:14:40,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:14:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:14:40,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:14:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:14:40,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231220834] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:14:40,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:14:40,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 07:14:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059274208] [2022-12-06 07:14:40,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:14:40,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:14:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:14:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:14:40,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:14:40,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 22 transitions, 66 flow. Second operand has 8 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-06 07:14:40,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:40,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:14:40,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:40,622 INFO L130 PetriNetUnfolder]: 53/104 cut-off events. [2022-12-06 07:14:40,622 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:14:40,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 104 events. 53/104 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 194 event pairs, 33 based on Foata normal form. 3/88 useless extension candidates. Maximal degree in co-relation 202. Up to 97 conditions per place. [2022-12-06 07:14:40,623 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2022-12-06 07:14:40,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 146 flow [2022-12-06 07:14:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:14:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:14:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-06 07:14:40,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-06 07:14:40,625 INFO L175 Difference]: Start difference. First operand has 22 places, 22 transitions, 66 flow. Second operand 6 states and 34 transitions. [2022-12-06 07:14:40,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 146 flow [2022-12-06 07:14:40,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:14:40,626 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 128 flow [2022-12-06 07:14:40,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 07:14:40,626 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2022-12-06 07:14:40,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:40,627 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 128 flow [2022-12-06 07:14:40,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:40,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:40,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 128 flow [2022-12-06 07:14:40,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 128 flow [2022-12-06 07:14:40,632 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 07:14:40,632 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:14:40,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 28 events. 4/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 16 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 22. Up to 12 conditions per place. [2022-12-06 07:14:40,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 128 flow [2022-12-06 07:14:40,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 07:14:40,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:14:40,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 07:14:40,633 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 128 flow [2022-12-06 07:14:40,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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-06 07:14:40,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:40,634 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:40,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:14:40,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:40,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash 510098673, now seen corresponding path program 2 times [2022-12-06 07:14:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:40,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005895542] [2022-12-06 07:14:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:14:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:41,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005895542] [2022-12-06 07:14:41,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005895542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:14:41,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201940025] [2022-12-06 07:14:41,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:14:41,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:41,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:41,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:14:41,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:14:41,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 07:14:41,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:14:41,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:14:41,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:14:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:14:41,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:14:41,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201940025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:14:41,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:14:41,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-06 07:14:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264233898] [2022-12-06 07:14:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:14:41,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:14:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:41,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:14:41,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:14:41,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:14:41,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:41,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:41,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:14:41,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:41,210 INFO L130 PetriNetUnfolder]: 64/123 cut-off events. [2022-12-06 07:14:41,210 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:14:41,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 123 events. 64/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 305 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 231. Up to 91 conditions per place. [2022-12-06 07:14:41,213 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 07:14:41,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 238 flow [2022-12-06 07:14:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:14:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:14:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 07:14:41,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 07:14:41,215 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 128 flow. Second operand 4 states and 34 transitions. [2022-12-06 07:14:41,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 238 flow [2022-12-06 07:14:41,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 222 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 07:14:41,218 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 139 flow [2022-12-06 07:14:41,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 07:14:41,219 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2022-12-06 07:14:41,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:41,219 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 139 flow [2022-12-06 07:14:41,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:41,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:41,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 139 flow [2022-12-06 07:14:41,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 139 flow [2022-12-06 07:14:41,226 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 07:14:41,226 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 07:14:41,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 36 events. 6/36 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2022-12-06 07:14:41,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 139 flow [2022-12-06 07:14:41,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 07:14:41,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:14:41,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 07:14:41,458 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 133 flow [2022-12-06 07:14:41,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:41,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:41,458 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:41,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:14:41,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 07:14:41,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:41,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash 682966989, now seen corresponding path program 3 times [2022-12-06 07:14:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:41,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948143908] [2022-12-06 07:14:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:14:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:41,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948143908] [2022-12-06 07:14:41,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948143908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:14:41,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594370617] [2022-12-06 07:14:41,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:14:41,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:41,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:14:41,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:14:41,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 07:14:41,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:14:41,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:14:41,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:14:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:14:41,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:14:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594370617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:14:41,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:14:41,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-06 07:14:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189720075] [2022-12-06 07:14:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:14:41,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:14:41,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:14:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:14:41,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:14:41,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:41,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:41,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:14:41,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:41,927 INFO L130 PetriNetUnfolder]: 79/152 cut-off events. [2022-12-06 07:14:41,928 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 07:14:41,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 152 events. 79/152 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 377 event pairs, 29 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 359. Up to 113 conditions per place. [2022-12-06 07:14:41,929 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 07:14:41,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 269 flow [2022-12-06 07:14:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:14:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:14:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 07:14:41,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-06 07:14:41,929 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 133 flow. Second operand 4 states and 39 transitions. [2022-12-06 07:14:41,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 269 flow [2022-12-06 07:14:41,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 255 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 07:14:41,936 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 144 flow [2022-12-06 07:14:41,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-06 07:14:41,937 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2022-12-06 07:14:41,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:41,938 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 144 flow [2022-12-06 07:14:41,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:41,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:41,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 144 flow [2022-12-06 07:14:41,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 144 flow [2022-12-06 07:14:41,944 INFO L130 PetriNetUnfolder]: 7/43 cut-off events. [2022-12-06 07:14:41,944 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 07:14:41,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 43 events. 7/43 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 63. Up to 8 conditions per place. [2022-12-06 07:14:41,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 144 flow [2022-12-06 07:14:41,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:14:42,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:14:42,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 07:14:42,162 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 147 flow [2022-12-06 07:14:42,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:42,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:42,163 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:42,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:14:42,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:42,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1743279212, now seen corresponding path program 1 times [2022-12-06 07:14:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:42,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669659992] [2022-12-06 07:14:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:14:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669659992] [2022-12-06 07:14:42,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669659992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:14:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302229913] [2022-12-06 07:14:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:42,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:42,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:42,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:14:42,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:14:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:42,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:14:42,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:14:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:14:42,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:14:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:14:42,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302229913] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:14:42,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:14:42,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 07:14:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466528124] [2022-12-06 07:14:42,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:14:42,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:14:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:14:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:14:42,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:14:42,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 147 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:42,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:42,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:14:42,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:42,737 INFO L130 PetriNetUnfolder]: 71/146 cut-off events. [2022-12-06 07:14:42,737 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-12-06 07:14:42,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 146 events. 71/146 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 39 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 352. Up to 137 conditions per place. [2022-12-06 07:14:42,738 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 21 selfloop transitions, 12 changer transitions 0/33 dead transitions. [2022-12-06 07:14:42,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 225 flow [2022-12-06 07:14:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:14:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:14:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-12-06 07:14:42,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22077922077922077 [2022-12-06 07:14:42,739 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 147 flow. Second operand 7 states and 34 transitions. [2022-12-06 07:14:42,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 225 flow [2022-12-06 07:14:42,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 220 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:14:42,740 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 188 flow [2022-12-06 07:14:42,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-06 07:14:42,741 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 18 predicate places. [2022-12-06 07:14:42,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:42,741 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 188 flow [2022-12-06 07:14:42,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:42,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:42,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 188 flow [2022-12-06 07:14:42,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 188 flow [2022-12-06 07:14:42,746 INFO L130 PetriNetUnfolder]: 7/48 cut-off events. [2022-12-06 07:14:42,746 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 07:14:42,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 48 events. 7/48 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 81 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 90. Up to 8 conditions per place. [2022-12-06 07:14:42,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 188 flow [2022-12-06 07:14:42,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 07:14:42,747 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:14:42,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:14:42,748 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 188 flow [2022-12-06 07:14:42,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:42,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:42,748 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:42,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:14:42,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:42,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 971959679, now seen corresponding path program 4 times [2022-12-06 07:14:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:42,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490131730] [2022-12-06 07:14:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:43,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490131730] [2022-12-06 07:14:43,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490131730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:14:43,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:14:43,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:14:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613295961] [2022-12-06 07:14:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:14:43,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:14:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:14:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:14:43,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:14:43,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:43,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:43,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:14:43,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:43,205 INFO L130 PetriNetUnfolder]: 91/182 cut-off events. [2022-12-06 07:14:43,206 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 07:14:43,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 182 events. 91/182 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 494 event pairs, 17 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 442. Up to 116 conditions per place. [2022-12-06 07:14:43,207 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-06 07:14:43,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 319 flow [2022-12-06 07:14:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:14:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:14:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 07:14:43,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2022-12-06 07:14:43,208 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 188 flow. Second operand 4 states and 35 transitions. [2022-12-06 07:14:43,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 319 flow [2022-12-06 07:14:43,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:14:43,210 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 201 flow [2022-12-06 07:14:43,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-06 07:14:43,212 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 19 predicate places. [2022-12-06 07:14:43,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:43,212 INFO L89 Accepts]: Start accepts. Operand has 42 places, 35 transitions, 201 flow [2022-12-06 07:14:43,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:43,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:43,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 201 flow [2022-12-06 07:14:43,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 201 flow [2022-12-06 07:14:43,222 INFO L130 PetriNetUnfolder]: 7/49 cut-off events. [2022-12-06 07:14:43,222 INFO L131 PetriNetUnfolder]: For 45/48 co-relation queries the response was YES. [2022-12-06 07:14:43,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 49 events. 7/49 cut-off events. For 45/48 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 74 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 87. Up to 7 conditions per place. [2022-12-06 07:14:43,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 201 flow [2022-12-06 07:14:43,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 07:14:43,223 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:14:43,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 07:14:43,224 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 201 flow [2022-12-06 07:14:43,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:43,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:43,224 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:43,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:14:43,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1842794874, now seen corresponding path program 2 times [2022-12-06 07:14:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:43,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357327333] [2022-12-06 07:14:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:43,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:43,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357327333] [2022-12-06 07:14:43,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357327333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:14:43,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:14:43,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:14:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329133345] [2022-12-06 07:14:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:14:43,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:14:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:14:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:14:43,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:14:43,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:43,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:43,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:14:43,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:43,472 INFO L130 PetriNetUnfolder]: 126/249 cut-off events. [2022-12-06 07:14:43,472 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-06 07:14:43,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 249 events. 126/249 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 834 event pairs, 43 based on Foata normal form. 4/231 useless extension candidates. Maximal degree in co-relation 689. Up to 153 conditions per place. [2022-12-06 07:14:43,474 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 47 selfloop transitions, 5 changer transitions 2/54 dead transitions. [2022-12-06 07:14:43,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 372 flow [2022-12-06 07:14:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:14:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:14:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:14:43,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 07:14:43,475 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 201 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:14:43,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 372 flow [2022-12-06 07:14:43,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:14:43,477 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 226 flow [2022-12-06 07:14:43,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-06 07:14:43,477 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 23 predicate places. [2022-12-06 07:14:43,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:43,478 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 226 flow [2022-12-06 07:14:43,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:43,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:43,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 226 flow [2022-12-06 07:14:43,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 226 flow [2022-12-06 07:14:43,486 INFO L130 PetriNetUnfolder]: 8/65 cut-off events. [2022-12-06 07:14:43,486 INFO L131 PetriNetUnfolder]: For 71/76 co-relation queries the response was YES. [2022-12-06 07:14:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 65 events. 8/65 cut-off events. For 71/76 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 141. Up to 12 conditions per place. [2022-12-06 07:14:43,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 226 flow [2022-12-06 07:14:43,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 07:14:43,488 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:14:43,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 07:14:43,488 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 226 flow [2022-12-06 07:14:43,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:43,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:43,489 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:43,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:14:43,489 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash -568237968, now seen corresponding path program 3 times [2022-12-06 07:14:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:43,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960674930] [2022-12-06 07:14:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:43,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:43,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960674930] [2022-12-06 07:14:43,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960674930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:14:43,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:14:43,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:14:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219897132] [2022-12-06 07:14:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:14:43,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:14:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:43,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:14:43,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:14:43,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:14:43,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:43,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:43,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:14:43,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:43,763 INFO L130 PetriNetUnfolder]: 116/229 cut-off events. [2022-12-06 07:14:43,763 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2022-12-06 07:14:43,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 229 events. 116/229 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 734 event pairs, 37 based on Foata normal form. 4/215 useless extension candidates. Maximal degree in co-relation 722. Up to 153 conditions per place. [2022-12-06 07:14:43,764 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 46 selfloop transitions, 6 changer transitions 3/55 dead transitions. [2022-12-06 07:14:43,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 403 flow [2022-12-06 07:14:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:14:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:14:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:14:43,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 07:14:43,766 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 226 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:14:43,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 403 flow [2022-12-06 07:14:43,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 395 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:14:43,769 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 240 flow [2022-12-06 07:14:43,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-06 07:14:43,770 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 26 predicate places. [2022-12-06 07:14:43,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:43,770 INFO L89 Accepts]: Start accepts. Operand has 49 places, 38 transitions, 240 flow [2022-12-06 07:14:43,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:43,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:43,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 38 transitions, 240 flow [2022-12-06 07:14:43,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 240 flow [2022-12-06 07:14:43,781 INFO L130 PetriNetUnfolder]: 12/64 cut-off events. [2022-12-06 07:14:43,781 INFO L131 PetriNetUnfolder]: For 96/100 co-relation queries the response was YES. [2022-12-06 07:14:43,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 64 events. 12/64 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 1 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 145. Up to 12 conditions per place. [2022-12-06 07:14:43,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 240 flow [2022-12-06 07:14:43,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 07:14:43,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:14:43,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 07:14:43,782 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 240 flow [2022-12-06 07:14:43,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:43,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:43,783 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:43,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:14:43,783 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash 574255094, now seen corresponding path program 1 times [2022-12-06 07:14:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:43,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128348518] [2022-12-06 07:14:43,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:44,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128348518] [2022-12-06 07:14:44,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128348518] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:14:44,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772632720] [2022-12-06 07:14:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:44,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:44,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:44,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:14:44,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:14:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:44,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:14:44,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:14:44,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:14:44,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 07:14:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:44,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:14:45,116 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 07:14:45,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-06 07:14:45,149 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:14:45,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-06 07:14:45,164 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:14:45,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-06 07:14:45,167 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 07:14:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:45,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772632720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:14:45,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:14:45,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2022-12-06 07:14:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312189132] [2022-12-06 07:14:45,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:14:45,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:14:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:14:45,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:14:45,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-12-06 07:14:45,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:14:45,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 240 flow. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:45,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:14:45,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:14:45,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:14:45,560 INFO L130 PetriNetUnfolder]: 151/286 cut-off events. [2022-12-06 07:14:45,561 INFO L131 PetriNetUnfolder]: For 501/501 co-relation queries the response was YES. [2022-12-06 07:14:45,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 286 events. 151/286 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 968 event pairs, 20 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 941. Up to 152 conditions per place. [2022-12-06 07:14:45,563 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 52 selfloop transitions, 19 changer transitions 2/73 dead transitions. [2022-12-06 07:14:45,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 525 flow [2022-12-06 07:14:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:14:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:14:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-12-06 07:14:45,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2636363636363636 [2022-12-06 07:14:45,565 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 240 flow. Second operand 10 states and 58 transitions. [2022-12-06 07:14:45,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 525 flow [2022-12-06 07:14:45,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 503 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 07:14:45,567 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 350 flow [2022-12-06 07:14:45,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-06 07:14:45,568 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 36 predicate places. [2022-12-06 07:14:45,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:45,568 INFO L89 Accepts]: Start accepts. Operand has 59 places, 48 transitions, 350 flow [2022-12-06 07:14:45,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:45,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:45,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 350 flow [2022-12-06 07:14:45,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 350 flow [2022-12-06 07:14:45,578 INFO L130 PetriNetUnfolder]: 21/89 cut-off events. [2022-12-06 07:14:45,578 INFO L131 PetriNetUnfolder]: For 163/171 co-relation queries the response was YES. [2022-12-06 07:14:45,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 89 events. 21/89 cut-off events. For 163/171 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 269 event pairs, 1 based on Foata normal form. 3/91 useless extension candidates. Maximal degree in co-relation 259. Up to 17 conditions per place. [2022-12-06 07:14:45,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 350 flow [2022-12-06 07:14:45,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 07:14:45,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [892] $Ultimate##0-->L67-2: Formula: (and (<= v_~result_8~0_90 2147483647) (= (mod v_~isNull_1~0_52 256) 0) (= |v_thread2Thread1of1ForFork1_minus_~b#1_52| |v_thread2Thread1of1ForFork1_minus_#in~b#1_30|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_61| (ite (= (ite (not (= v_~result_8~0_90 0)) 1 0) 0) 0 1)) (= v_~result_8~0_90 |v_thread2Thread1of1ForFork1_minus_#res#1_38|) (<= 0 (+ v_~result_8~0_90 2147483648)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_67|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_52| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_52|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_52|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (select (select |v_#memory_int_169| v_~o_0~0.base_56) v_~o_0~0.offset_56) |v_thread2Thread1of1ForFork1_minus_#in~b#1_30|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_52| |v_thread2Thread1of1ForFork1_minus_#in~a#1_28|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_28| (select (select |v_#memory_int_169| v_~o_2~0.base_80) v_~o_2~0.offset_80)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_52| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_52| |v_thread2Thread1of1ForFork1_minus_#res#1_38|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (not (= 0 (ite (= (mod v_~isNull_3~0_48 256) 0) 1 0)))) InVars {~o_2~0.offset=v_~o_2~0.offset_80, ~o_2~0.base=v_~o_2~0.base_80, ~isNull_3~0=v_~isNull_3~0_48, ~isNull_1~0=v_~isNull_1~0_52, ~o_0~0.offset=v_~o_0~0.offset_56, #memory_int=|v_#memory_int_169|, ~o_0~0.base=v_~o_0~0.base_56} OutVars{~o_2~0.offset=v_~o_2~0.offset_80, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_52|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_38|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, ~o_0~0.base=v_~o_0~0.base_56, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_61|, ~result_8~0=v_~result_8~0_90, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_38|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_67|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_42|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, ~o_2~0.base=v_~o_2~0.base_80, ~isNull_3~0=v_~isNull_3~0_48, ~isNull_1~0=v_~isNull_1~0_52, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_28|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_34|, ~o_0~0.offset=v_~o_0~0.offset_56, #memory_int=|v_#memory_int_169|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_38|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_30|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:14:46,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] $Ultimate##0-->L67-2: Formula: (and (= |v_thread2Thread1of1ForFork1_~stop~1#1_Out_16| v_~isNull_1~0_In_5) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18| (ite (= (mod v_~isNull_3~0_In_5 256) 0) 1 0)) (= v_~result_8~0_Out_28 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_14| 0)) InVars {~isNull_3~0=v_~isNull_3~0_In_5, ~isNull_1~0=v_~isNull_1~0_In_5} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|, ~isNull_3~0=v_~isNull_3~0_In_5, ~isNull_1~0=v_~isNull_1~0_In_5, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, ~result_8~0=v_~result_8~0_Out_28, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_Out_16|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_8~0, thread2Thread1of1ForFork1_~stop~1#1, thread2Thread1of1ForFork1_~i~1#1] and [876] $Ultimate##0-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~stop~0#1_Out_22| v_~isNull_3~0_In_3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_20|) (= v_~result_5~0_Out_30 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (mod v_~isNull_1~0_In_3 256) 0) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_20| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_20| 0)) InVars {~isNull_3~0=v_~isNull_3~0_In_3, ~isNull_1~0=v_~isNull_1~0_In_3} OutVars{~result_5~0=v_~result_5~0_Out_30, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_10|, ~isNull_3~0=v_~isNull_3~0_In_3, ~isNull_1~0=v_~isNull_1~0_In_3, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_20|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_Out_22|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_20|} AuxVars[] AssignedVars[~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] [2022-12-06 07:14:46,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [897] $Ultimate##0-->L53-2: Formula: (and (= v_~isNull_1~0_61 |v_thread2Thread1of1ForFork1_~stop~1#1_78|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|) (= v_~result_8~0_109 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| 0)) (= |v_thread1Thread1of1ForFork0_~stop~0#1_73| v_~isNull_3~0_57) (= (ite (= (mod v_~isNull_1~0_61 256) 0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (= v_~result_5~0_110 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| 0)) (= (ite (= (mod v_~isNull_3~0_57 256) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_84|) (= |v_thread1Thread1of1ForFork0_~i~0#1_108| 0)) InVars {~isNull_3~0=v_~isNull_3~0_57, ~isNull_1~0=v_~isNull_1~0_61} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|, ~result_5~0=v_~result_5~0_110, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, ~isNull_3~0=v_~isNull_3~0_57, ~isNull_1~0=v_~isNull_1~0_61, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_73|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_92|, ~result_8~0=v_~result_8~0_109, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_78|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_84|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_8~0, thread2Thread1of1ForFork1_~stop~1#1, thread2Thread1of1ForFork1_~i~1#1] and [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] [2022-12-06 07:14:46,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [894] $Ultimate##0-->L53-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~o_2~0.base_85))) (and (= v_~result_5~0_108 |v_thread1Thread1of1ForFork0_minus_#res#1_50|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_59| |v_thread2Thread1of1ForFork1_minus_#in~a#1_35|) (= (mod v_~isNull_1~0_57 256) 0) (<= 0 (+ v_~result_8~0_103 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_59| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_59| |v_thread2Thread1of1ForFork1_minus_#res#1_45|)) (<= 0 (+ v_~result_5~0_108 2147483648)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_56|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_56| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_56|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_56| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_56| |v_thread1Thread1of1ForFork0_minus_#res#1_50|)) (<= v_~result_5~0_108 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_42| |v_thread1Thread1of1ForFork0_#t~mem1#1_62|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_56| |v_thread1Thread1of1ForFork0_minus_#in~b#1_42|) (= |v_thread1Thread1of1ForFork0_~i~0#1_104| (+ |v_thread1Thread1of1ForFork0_~i~0#1_105| 1)) (= v_~result_8~0_103 |v_thread2Thread1of1ForFork1_minus_#res#1_45|) (= (ite (= (ite (not (= v_~result_8~0_103 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_72|) (= (select .cse0 v_~o_2~0.offset_85) |v_thread2Thread1of1ForFork1_minus_#in~a#1_35|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_59|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= (ite (= (ite (not (= v_~result_5~0_108 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_71|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_78|) (not (= 0 (ite (= (mod v_~isNull_3~0_53 256) 0) 1 0))) (<= v_~result_8~0_103 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_37| (select (select |v_#memory_int_183| v_~o_0~0.base_61) v_~o_0~0.offset_61)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_56| |v_thread1Thread1of1ForFork0_minus_#in~a#1_42|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_42| (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_105| 4) v_~o_2~0.offset_85))) (= |v_thread2Thread1of1ForFork1_minus_~b#1_59| |v_thread2Thread1of1ForFork1_minus_#in~b#1_37|))) InVars {~o_2~0.offset=v_~o_2~0.offset_85, ~o_2~0.base=v_~o_2~0.base_85, ~isNull_3~0=v_~isNull_3~0_53, ~isNull_1~0=v_~isNull_1~0_57, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_105|, #memory_int=|v_#memory_int_183|, ~o_0~0.offset=v_~o_0~0.offset_61, ~o_0~0.base=v_~o_0~0.base_61, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_85, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_42|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_46|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_86|, ~o_0~0.base=v_~o_0~0.base_61, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_52|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_78|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_59|, ~result_5~0=v_~result_5~0_108, ~isNull_3~0=v_~isNull_3~0_53, ~isNull_1~0=v_~isNull_1~0_57, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, ~o_0~0.offset=v_~o_0~0.offset_61, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_45|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_37|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_50|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_59|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_36|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_71|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_72|, ~result_8~0=v_~result_8~0_103, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_45|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_49|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_42|, ~o_2~0.base=v_~o_2~0.base_85, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_56|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_104|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_56|, #memory_int=|v_#memory_int_183|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:14:47,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [901] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_79| 256) 0))) (.cse1 (select |v_#memory_int_189| v_~o_2~0.base_91))) (and (= |v_thread2Thread1of1ForFork1_minus_~a#1_69| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_69| |v_thread2Thread1of1ForFork1_minus_#res#1_55|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_69| |v_thread2Thread1of1ForFork1_minus_#in~b#1_47|) (= (mod v_~isNull_1~0_67 256) 0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_117| 1) |v_thread1Thread1of1ForFork0_~i~0#1_116|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_100| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_69| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_69|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_69|)) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_60| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_60| |v_thread1Thread1of1ForFork0_minus_#res#1_54|)) (= v_~result_5~0_116 (ite .cse0 |v_thread1Thread1of1ForFork0_minus_#res#1_54| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_18| 0) (= (select .cse1 v_~o_2~0.offset_91) |v_thread2Thread1of1ForFork1_minus_#in~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_46| |v_thread1Thread1of1ForFork0_#t~mem1#1_70|) (or (not (< |v_thread1Thread1of1ForFork0_~i~0#1_116| 5)) .cse0) (not (= (ite (= (mod v_~isNull_3~0_63 256) 0) 1 0) 0)) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_54|)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_54| 2147483647) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_60|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_60| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_60|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= (ite (= (ite (not (= 0 |v_thread1Thread1of1ForFork0_minus_#res#1_54|)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_79|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_100| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|) (= (ite (= (ite (not (= v_~result_8~0_119 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_86|) (= (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_117| 4) v_~o_2~0.offset_91)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_46|) (= v_~result_8~0_119 |v_thread2Thread1of1ForFork1_minus_#res#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_69| |v_thread2Thread1of1ForFork1_minus_#in~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_60| |v_thread1Thread1of1ForFork0_minus_#in~b#1_46|) (= (select (select |v_#memory_int_189| v_~o_0~0.base_67) v_~o_0~0.offset_67) |v_thread2Thread1of1ForFork1_minus_#in~b#1_47|) (<= 0 (+ v_~result_8~0_119 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_105| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_60| |v_thread1Thread1of1ForFork0_minus_#in~a#1_46|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_92|) (<= v_~result_8~0_119 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_18| 0))) InVars {~o_2~0.offset=v_~o_2~0.offset_91, ~o_2~0.base=v_~o_2~0.base_91, ~isNull_3~0=v_~isNull_3~0_63, ~isNull_1~0=v_~isNull_1~0_67, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_117|, ~o_0~0.offset=v_~o_0~0.offset_67, #memory_int=|v_#memory_int_189|, ~o_0~0.base=v_~o_0~0.base_67, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|} OutVars{~o_2~0.offset=v_~o_2~0.offset_91, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_46|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_50|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_100|, ~o_0~0.base=v_~o_0~0.base_67, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_92|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_69|, ~result_5~0=v_~result_5~0_116, ~isNull_3~0=v_~isNull_3~0_63, ~isNull_1~0=v_~isNull_1~0_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_105|, ~o_0~0.offset=v_~o_0~0.offset_67, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_47|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_18|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_54|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_18|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_69|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_79|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_40|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_86|, ~result_8~0=v_~result_8~0_119, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_55|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_59|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_46|, ~o_2~0.base=v_~o_2~0.base_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_130|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_60|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_60|, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:14:48,093 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:14:48,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2525 [2022-12-06 07:14:48,093 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 361 flow [2022-12-06 07:14:48,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:48,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:48,094 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:48,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:14:48,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:48,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:14:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1309271194, now seen corresponding path program 2 times [2022-12-06 07:14:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:48,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915946634] [2022-12-06 07:14:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:48,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915946634] [2022-12-06 07:14:48,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915946634] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:14:48,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866236700] [2022-12-06 07:14:48,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:14:48,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:48,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:14:48,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:14:49,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:14:49,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:14:49,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:14:49,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:14:49,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:14:49,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-12-06 07:14:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:14:49,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:19,986 WARN L233 SmtUtils]: Spent 22.46s on a formula simplification. DAG size of input: 37 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:15:20,029 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 07:15:20,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2022-12-06 07:15:20,062 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:15:20,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 1 [2022-12-06 07:15:20,069 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:15:20,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 1 [2022-12-06 07:15:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:15:20,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866236700] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:20,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:20,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2022-12-06 07:15:20,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819029959] [2022-12-06 07:15:20,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:20,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:15:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:20,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:15:20,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=387, Unknown=4, NotChecked=0, Total=462 [2022-12-06 07:15:20,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:15:20,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 361 flow. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:20,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:20,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:15:20,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:20,632 INFO L130 PetriNetUnfolder]: 176/341 cut-off events. [2022-12-06 07:15:20,632 INFO L131 PetriNetUnfolder]: For 1038/1038 co-relation queries the response was YES. [2022-12-06 07:15:20,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 341 events. 176/341 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1314 event pairs, 10 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1354. Up to 114 conditions per place. [2022-12-06 07:15:20,634 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 58 selfloop transitions, 20 changer transitions 7/85 dead transitions. [2022-12-06 07:15:20,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 716 flow [2022-12-06 07:15:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:15:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:15:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-12-06 07:15:20,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 07:15:20,636 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 361 flow. Second operand 11 states and 75 transitions. [2022-12-06 07:15:20,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 716 flow [2022-12-06 07:15:20,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 642 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-06 07:15:20,640 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 374 flow [2022-12-06 07:15:20,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=374, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2022-12-06 07:15:20,641 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 42 predicate places. [2022-12-06 07:15:20,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:20,641 INFO L89 Accepts]: Start accepts. Operand has 65 places, 49 transitions, 374 flow [2022-12-06 07:15:20,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:20,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:20,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 49 transitions, 374 flow [2022-12-06 07:15:20,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 49 transitions, 374 flow [2022-12-06 07:15:20,653 INFO L130 PetriNetUnfolder]: 28/101 cut-off events. [2022-12-06 07:15:20,653 INFO L131 PetriNetUnfolder]: For 218/221 co-relation queries the response was YES. [2022-12-06 07:15:20,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 101 events. 28/101 cut-off events. For 218/221 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 315 event pairs, 2 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 362. Up to 26 conditions per place. [2022-12-06 07:15:20,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 49 transitions, 374 flow [2022-12-06 07:15:20,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 07:15:20,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:21,795 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:15:21,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1154 [2022-12-06 07:15:21,795 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 362 flow [2022-12-06 07:15:21,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:21,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:21,796 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:21,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:21,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:21,996 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1648477157, now seen corresponding path program 1 times [2022-12-06 07:15:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:21,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847194221] [2022-12-06 07:15:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:21,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:15:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:22,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847194221] [2022-12-06 07:15:22,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847194221] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:22,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917737584] [2022-12-06 07:15:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:22,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:22,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:22,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:15:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:22,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 07:15:22,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:23,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:23,135 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 07:15:23,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-06 07:15:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:15:23,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:23,406 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 07:15:23,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-06 07:15:23,443 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 07:15:23,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-06 07:15:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:15:23,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917737584] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:23,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:23,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 25 [2022-12-06 07:15:23,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310884317] [2022-12-06 07:15:23,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:23,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:15:23,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:23,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:15:23,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-12-06 07:15:23,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:15:23,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 362 flow. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:23,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:23,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:15:23,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:24,437 INFO L130 PetriNetUnfolder]: 204/364 cut-off events. [2022-12-06 07:15:24,438 INFO L131 PetriNetUnfolder]: For 1508/1508 co-relation queries the response was YES. [2022-12-06 07:15:24,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 364 events. 204/364 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1318 event pairs, 30 based on Foata normal form. 6/370 useless extension candidates. Maximal degree in co-relation 1681. Up to 198 conditions per place. [2022-12-06 07:15:24,440 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 59 selfloop transitions, 38 changer transitions 0/97 dead transitions. [2022-12-06 07:15:24,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 925 flow [2022-12-06 07:15:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:15:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:15:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-12-06 07:15:24,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22010869565217392 [2022-12-06 07:15:24,442 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 362 flow. Second operand 16 states and 81 transitions. [2022-12-06 07:15:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 925 flow [2022-12-06 07:15:24,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 97 transitions, 801 flow, removed 46 selfloop flow, removed 8 redundant places. [2022-12-06 07:15:24,446 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 636 flow [2022-12-06 07:15:24,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=636, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2022-12-06 07:15:24,446 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 49 predicate places. [2022-12-06 07:15:24,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:24,446 INFO L89 Accepts]: Start accepts. Operand has 72 places, 67 transitions, 636 flow [2022-12-06 07:15:24,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:24,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:24,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 67 transitions, 636 flow [2022-12-06 07:15:24,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 636 flow [2022-12-06 07:15:24,460 INFO L130 PetriNetUnfolder]: 42/124 cut-off events. [2022-12-06 07:15:24,460 INFO L131 PetriNetUnfolder]: For 427/437 co-relation queries the response was YES. [2022-12-06 07:15:24,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 124 events. 42/124 cut-off events. For 427/437 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 421 event pairs, 0 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 529. Up to 42 conditions per place. [2022-12-06 07:15:24,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 67 transitions, 636 flow [2022-12-06 07:15:24,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:15:24,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_54|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:24,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:25,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [896] $Ultimate##0-->L67-2: Formula: (let ((.cse0 (select |v_#memory_int_185| v_~o_2~0.base_87)) (.cse1 (select |v_#memory_int_185| v_~o_0~0.base_63))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_80|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_61| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_61| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= (mod (ite (= (ite (not (= (select .cse0 v_~o_2~0.offset_87) (select .cse1 v_~o_0~0.offset_63))) 1 0) 0) 0 1) 256) 0) (= (select .cse0 (+ v_~o_2~0.offset_87 4)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_37|) (= (ite (= (ite (not (= v_~result_8~0_105 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_74|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_39| (select .cse1 (+ v_~o_0~0.offset_63 4))) (= |v_thread2Thread1of1ForFork1_minus_~b#1_61| |v_thread2Thread1of1ForFork1_minus_#in~b#1_39|) (= v_~result_8~0_105 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_61| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_61|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_61|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (not (= (ite (= (mod v_~isNull_3~0_55 256) 0) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|) (<= 0 (+ v_~result_8~0_105 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_61| |v_thread2Thread1of1ForFork1_minus_#in~a#1_37|) (= (mod v_~isNull_1~0_59 256) 0) (<= v_~result_8~0_105 2147483647))) InVars {~o_2~0.offset=v_~o_2~0.offset_87, ~o_2~0.base=v_~o_2~0.base_87, ~isNull_3~0=v_~isNull_3~0_55, ~isNull_1~0=v_~isNull_1~0_59, ~o_0~0.offset=v_~o_0~0.offset_63, #memory_int=|v_#memory_int_185|, ~o_0~0.base=v_~o_0~0.base_63} OutVars{~o_2~0.offset=v_~o_2~0.offset_87, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_61|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_88|, ~o_0~0.base=v_~o_0~0.base_63, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_74|, ~result_8~0=v_~result_8~0_105, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_47|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_80|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_51|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, ~o_2~0.base=v_~o_2~0.base_87, ~isNull_3~0=v_~isNull_3~0_55, ~isNull_1~0=v_~isNull_1~0_59, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_37|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, ~o_0~0.offset=v_~o_0~0.offset_63, #memory_int=|v_#memory_int_185|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_47|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:26,079 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:15:26,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1633 [2022-12-06 07:15:26,079 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 635 flow [2022-12-06 07:15:26,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:26,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:26,080 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:26,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:26,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:26,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash -186925199, now seen corresponding path program 1 times [2022-12-06 07:15:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:26,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739429047] [2022-12-06 07:15:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:15:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:26,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739429047] [2022-12-06 07:15:26,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739429047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:26,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79451896] [2022-12-06 07:15:26,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:26,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:26,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:26,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:26,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:15:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:26,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 07:15:26,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:27,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:27,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 07:15:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:15:27,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:27,525 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 07:15:27,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 64 [2022-12-06 07:15:27,533 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 07:15:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:15:27,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79451896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:27,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:27,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2022-12-06 07:15:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871810248] [2022-12-06 07:15:27,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:27,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:15:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:15:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-12-06 07:15:27,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:15:27,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 635 flow. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:27,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:27,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:15:27,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:28,299 INFO L130 PetriNetUnfolder]: 271/483 cut-off events. [2022-12-06 07:15:28,299 INFO L131 PetriNetUnfolder]: For 2234/2234 co-relation queries the response was YES. [2022-12-06 07:15:28,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 483 events. 271/483 cut-off events. For 2234/2234 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1946 event pairs, 49 based on Foata normal form. 2/485 useless extension candidates. Maximal degree in co-relation 2483. Up to 275 conditions per place. [2022-12-06 07:15:28,304 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 71 selfloop transitions, 36 changer transitions 5/112 dead transitions. [2022-12-06 07:15:28,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 112 transitions, 1196 flow [2022-12-06 07:15:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:15:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:15:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-06 07:15:28,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-06 07:15:28,306 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 635 flow. Second operand 15 states and 81 transitions. [2022-12-06 07:15:28,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 112 transitions, 1196 flow [2022-12-06 07:15:28,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 1084 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-12-06 07:15:28,313 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 848 flow [2022-12-06 07:15:28,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=848, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2022-12-06 07:15:28,314 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 64 predicate places. [2022-12-06 07:15:28,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:28,314 INFO L89 Accepts]: Start accepts. Operand has 87 places, 81 transitions, 848 flow [2022-12-06 07:15:28,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:28,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:28,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 81 transitions, 848 flow [2022-12-06 07:15:28,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 81 transitions, 848 flow [2022-12-06 07:15:28,331 INFO L130 PetriNetUnfolder]: 53/158 cut-off events. [2022-12-06 07:15:28,331 INFO L131 PetriNetUnfolder]: For 624/647 co-relation queries the response was YES. [2022-12-06 07:15:28,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 158 events. 53/158 cut-off events. For 624/647 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 620 event pairs, 0 based on Foata normal form. 1/157 useless extension candidates. Maximal degree in co-relation 737. Up to 51 conditions per place. [2022-12-06 07:15:28,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 81 transitions, 848 flow [2022-12-06 07:15:28,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 07:15:28,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:15:28,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:15:30,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:15:32,488 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:15:32,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4174 [2022-12-06 07:15:32,489 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 938 flow [2022-12-06 07:15:32,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:32,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:32,489 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:32,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:15:32,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 07:15:32,694 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash 823466526, now seen corresponding path program 1 times [2022-12-06 07:15:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:32,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677578969] [2022-12-06 07:15:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 07:15:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:33,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677578969] [2022-12-06 07:15:33,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677578969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:33,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847422778] [2022-12-06 07:15:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:33,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:33,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:33,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:33,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:15:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:33,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 07:15:33,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:33,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:15:33,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 07:15:33,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:33,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 07:15:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 07:15:33,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:34,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse2 (select .cse1 ~o_2~0.base))) (let ((.cse0 (select .cse2 .cse3))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse0) (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse2 c_~o_2~0.offset)) (< .cse0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse6 (select .cse7 ~o_2~0.base))) (let ((.cse4 (select (select .cse7 c_~o_0~0.base) c_~o_0~0.offset)) (.cse5 (select .cse6 c_~o_2~0.offset))) (or (= .cse4 .cse5) (< .cse4 .cse5) (< (select .cse6 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse8 (select .cse11 ~o_2~0.base))) (let ((.cse10 (select .cse8 c_~o_2~0.offset)) (.cse9 (select (select .cse11 c_~o_0~0.base) c_~o_0~0.offset))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse8 .cse3)) (= .cse9 .cse10) (< .cse10 .cse9)))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (= (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse12 ~o_2~0.base) c_~o_2~0.offset))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse14 (select .cse13 ~o_2~0.base))) (let ((.cse15 (select .cse14 .cse3))) (or (< (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset) (select .cse14 c_~o_2~0.offset)) (= .cse15 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse15 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse17 (select .cse18 ~o_2~0.base))) (let ((.cse16 (select .cse17 .cse3))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse16) (= .cse16 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< (select .cse17 c_~o_2~0.offset) (select (select .cse18 c_~o_0~0.base) c_~o_0~0.offset))))))) (forall ((v_ArrVal_691 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_691))) (let ((.cse21 (select .cse22 ~o_2~0.base))) (let ((.cse20 (select .cse21 c_~o_2~0.offset)) (.cse19 (select (select .cse22 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse19 .cse20) (= (select .cse21 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse20 .cse19)))))))) is different from false [2022-12-06 07:15:34,071 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 07:15:34,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 149 [2022-12-06 07:15:34,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:34,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 86 [2022-12-06 07:15:34,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:34,469 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:15:34,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 1 [2022-12-06 07:15:34,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:34,476 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:15:34,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 07:15:34,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:34,482 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:15:34,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 07:15:34,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:34,489 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:15:34,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-06 07:15:34,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:34,499 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-06 07:15:34,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 1 [2022-12-06 07:15:34,501 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 07:15:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 07:15:34,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847422778] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:34,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:34,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2022-12-06 07:15:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408928005] [2022-12-06 07:15:34,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:34,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 07:15:34,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 07:15:34,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=607, Unknown=1, NotChecked=50, Total=756 [2022-12-06 07:15:34,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:15:34,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 938 flow. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:34,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:34,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:15:34,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:38,148 INFO L130 PetriNetUnfolder]: 439/786 cut-off events. [2022-12-06 07:15:38,148 INFO L131 PetriNetUnfolder]: For 5371/5371 co-relation queries the response was YES. [2022-12-06 07:15:38,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4441 conditions, 786 events. 439/786 cut-off events. For 5371/5371 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3774 event pairs, 74 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 4367. Up to 247 conditions per place. [2022-12-06 07:15:38,154 INFO L137 encePairwiseOnDemand]: 7/32 looper letters, 109 selfloop transitions, 62 changer transitions 11/182 dead transitions. [2022-12-06 07:15:38,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 182 transitions, 2231 flow [2022-12-06 07:15:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:15:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:15:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 129 transitions. [2022-12-06 07:15:38,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23713235294117646 [2022-12-06 07:15:38,155 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 938 flow. Second operand 17 states and 129 transitions. [2022-12-06 07:15:38,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 182 transitions, 2231 flow [2022-12-06 07:15:38,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 182 transitions, 1974 flow, removed 122 selfloop flow, removed 7 redundant places. [2022-12-06 07:15:38,168 INFO L231 Difference]: Finished difference. Result has 100 places, 114 transitions, 1396 flow [2022-12-06 07:15:38,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1396, PETRI_PLACES=100, PETRI_TRANSITIONS=114} [2022-12-06 07:15:38,168 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 77 predicate places. [2022-12-06 07:15:38,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:38,169 INFO L89 Accepts]: Start accepts. Operand has 100 places, 114 transitions, 1396 flow [2022-12-06 07:15:38,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:38,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:38,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 114 transitions, 1396 flow [2022-12-06 07:15:38,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 114 transitions, 1396 flow [2022-12-06 07:15:38,211 INFO L130 PetriNetUnfolder]: 188/433 cut-off events. [2022-12-06 07:15:38,211 INFO L131 PetriNetUnfolder]: For 2146/2173 co-relation queries the response was YES. [2022-12-06 07:15:38,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 433 events. 188/433 cut-off events. For 2146/2173 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2379 event pairs, 28 based on Foata normal form. 6/411 useless extension candidates. Maximal degree in co-relation 2218. Up to 165 conditions per place. [2022-12-06 07:15:38,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 114 transitions, 1396 flow [2022-12-06 07:15:38,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 07:15:39,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:39,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:39,752 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:15:39,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1583 [2022-12-06 07:15:39,752 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 110 transitions, 1368 flow [2022-12-06 07:15:39,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:39,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:39,752 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:39,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:39,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 07:15:39,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:39,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash 888277492, now seen corresponding path program 1 times [2022-12-06 07:15:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:39,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821115670] [2022-12-06 07:15:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:15:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821115670] [2022-12-06 07:15:40,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821115670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442004718] [2022-12-06 07:15:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:40,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:40,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:40,572 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:40,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:15:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:40,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 07:15:40,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:40,809 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 07:15:40,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2022-12-06 07:15:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:40,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:41,153 INFO L321 Elim1Store]: treesize reduction 26, result has 64.4 percent of original size [2022-12-06 07:15:41,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 80 [2022-12-06 07:15:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:41,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442004718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:41,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:41,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 20 [2022-12-06 07:15:41,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720238390] [2022-12-06 07:15:41,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:41,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:15:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:41,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:15:41,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:15:41,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:15:41,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 110 transitions, 1368 flow. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:41,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:41,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:15:41,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:42,114 INFO L130 PetriNetUnfolder]: 473/833 cut-off events. [2022-12-06 07:15:42,115 INFO L131 PetriNetUnfolder]: For 5911/5911 co-relation queries the response was YES. [2022-12-06 07:15:42,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 833 events. 473/833 cut-off events. For 5911/5911 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4019 event pairs, 73 based on Foata normal form. 8/841 useless extension candidates. Maximal degree in co-relation 5054. Up to 517 conditions per place. [2022-12-06 07:15:42,122 INFO L137 encePairwiseOnDemand]: 12/33 looper letters, 92 selfloop transitions, 82 changer transitions 0/174 dead transitions. [2022-12-06 07:15:42,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 174 transitions, 2272 flow [2022-12-06 07:15:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:15:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:15:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 104 transitions. [2022-12-06 07:15:42,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2101010101010101 [2022-12-06 07:15:42,123 INFO L175 Difference]: Start difference. First operand has 94 places, 110 transitions, 1368 flow. Second operand 15 states and 104 transitions. [2022-12-06 07:15:42,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 174 transitions, 2272 flow [2022-12-06 07:15:42,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 174 transitions, 2172 flow, removed 44 selfloop flow, removed 9 redundant places. [2022-12-06 07:15:42,144 INFO L231 Difference]: Finished difference. Result has 108 places, 137 transitions, 1935 flow [2022-12-06 07:15:42,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1935, PETRI_PLACES=108, PETRI_TRANSITIONS=137} [2022-12-06 07:15:42,145 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 85 predicate places. [2022-12-06 07:15:42,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:42,145 INFO L89 Accepts]: Start accepts. Operand has 108 places, 137 transitions, 1935 flow [2022-12-06 07:15:42,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:42,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:42,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 137 transitions, 1935 flow [2022-12-06 07:15:42,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 137 transitions, 1935 flow [2022-12-06 07:15:42,204 INFO L130 PetriNetUnfolder]: 207/485 cut-off events. [2022-12-06 07:15:42,205 INFO L131 PetriNetUnfolder]: For 3591/3624 co-relation queries the response was YES. [2022-12-06 07:15:42,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2945 conditions, 485 events. 207/485 cut-off events. For 3591/3624 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2837 event pairs, 45 based on Foata normal form. 2/450 useless extension candidates. Maximal degree in co-relation 2881. Up to 168 conditions per place. [2022-12-06 07:15:42,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 137 transitions, 1935 flow [2022-12-06 07:15:42,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 07:15:42,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [924] $Ultimate##0-->L53-2: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_192| 4)) (.cse0 (select |v_#memory_int_252| v_~o_2~0.base_133)) (.cse1 (select |v_#memory_int_252| v_~o_0~0.base_106))) (and (<= v_~result_8~0_164 2147483647) (<= 0 (+ v_~result_5~0_166 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_91| |v_thread1Thread1of1ForFork0_minus_#in~a#1_77|) (= (mod (ite (= (ite (not (= (select .cse0 v_~o_2~0.offset_133) (select .cse1 v_~o_0~0.offset_107))) 1 0) 0) 0 1) 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (= (select .cse1 (+ (- 4) .cse2 v_~o_0~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~a#1_77|) (<= v_~result_5~0_166 2147483647) (= v_~result_8~0_164 |v_thread2Thread1of1ForFork1_minus_#res#1_82|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_91|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_91| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_91|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_131|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (= (select .cse0 (+ (- 4) v_~o_2~0.offset_133 .cse2)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_77|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_91| |v_thread1Thread1of1ForFork0_minus_#in~b#1_77|) (<= 0 (+ v_~result_8~0_164 2147483648)) (= (mod v_~isNull_1~0_81 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_96| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_96|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_96|)) 1 0)) (= v_~result_5~0_166 |v_thread1Thread1of1ForFork0_minus_#res#1_85|) (= (select .cse0 (+ v_~o_2~0.offset_133 4)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_72|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_91| |v_thread1Thread1of1ForFork0_minus_#res#1_85|) |v_thread1Thread1of1ForFork0_minus_~a#1_91|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_96| |v_thread2Thread1of1ForFork1_minus_#in~a#1_72|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_96| |v_thread2Thread1of1ForFork1_minus_#in~b#1_74|) (= (mod (ite (= (ite (not (= (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_194| 4) v_~o_2~0.offset_133)) |v_thread1Thread1of1ForFork0_#t~mem1#1_142|)) 1 0) 0) 0 1) 256) 0) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_96| |v_thread2Thread1of1ForFork1_minus_#res#1_82|) |v_thread2Thread1of1ForFork1_minus_~a#1_96|) (< |v_thread1Thread1of1ForFork0_~i~0#1_192| 6) (= (ite (= (ite (not (= v_~result_5~0_166 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_133|) (= (ite (= (ite (not (= v_~result_8~0_164 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_125|) (not (= (ite (= (mod v_~isNull_3~0_77 256) 0) 1 0) 0)) (= (select .cse1 (+ 4 v_~o_0~0.offset_107)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_74|) (= |v_thread1Thread1of1ForFork0_~i~0#1_192| (+ |v_thread1Thread1of1ForFork0_~i~0#1_194| 2)))) InVars {~o_2~0.offset=v_~o_2~0.offset_133, ~o_2~0.base=v_~o_2~0.base_133, ~isNull_3~0=v_~isNull_3~0_77, ~isNull_1~0=v_~isNull_1~0_81, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, #memory_int=|v_#memory_int_252|, ~o_0~0.offset=v_~o_0~0.offset_107, ~o_0~0.base=v_~o_0~0.base_106, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_142|} OutVars{~o_2~0.offset=v_~o_2~0.offset_133, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_77|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_81|, ~o_0~0.base=v_~o_0~0.base_106, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_82|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_87|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_131|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_96|, ~result_5~0=v_~result_5~0_166, ~isNull_3~0=v_~isNull_3~0_77, ~isNull_1~0=v_~isNull_1~0_81, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_72|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, ~o_0~0.offset=v_~o_0~0.offset_107, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_82|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_74|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_85|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_96|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_71|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_133|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_125|, ~result_8~0=v_~result_8~0_164, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_82|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_86|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_77|, ~o_2~0.base=v_~o_2~0.base_133, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_91|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_192|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_91|, #memory_int=|v_#memory_int_252|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:42,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [926] $Ultimate##0-->L53-2: Formula: (let ((.cse3 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_127| 256) 0))) (.cse0 (select |v_#memory_int_254| v_~o_2~0.base_135)) (.cse1 (select |v_#memory_int_254| v_~o_0~0.base_108)) (.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_200| 4))) (and (= (mod (ite (= (ite (not (= (select .cse0 v_~o_2~0.offset_135) (select .cse1 v_~o_0~0.offset_109))) 1 0) 0) 0 1) 256) 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_95|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_95| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_95|))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|) (= (mod (ite (= (ite (not (= (select .cse0 (+ .cse2 v_~o_2~0.offset_135)) |v_thread1Thread1of1ForFork0_#t~mem1#1_146|)) 1 0) 0) 0 1) 256) 0) (not (= (ite (= (mod v_~isNull_3~0_79 256) 0) 1 0) 0)) (= (ite (= (ite (not (= v_~result_5~0_170 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_137|) (<= 0 (+ v_~result_5~0_170 2147483648)) (= v_~result_5~0_170 |v_thread1Thread1of1ForFork0_minus_#res#1_89|) (< |v_thread1Thread1of1ForFork0_~i~0#1_200| 4) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_29|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_133|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_84| 2147483648)) (<= v_~result_5~0_170 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_198| (+ |v_thread1Thread1of1ForFork0_~i~0#1_200| 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_98| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_98|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_98|)) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#in~b#1_81|) (= (select .cse1 (+ 4 v_~o_0~0.offset_109)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_76|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_84| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_95| |v_thread1Thread1of1ForFork0_minus_#in~a#1_81|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_98| |v_thread2Thread1of1ForFork1_minus_#res#1_84|) |v_thread2Thread1of1ForFork1_minus_~a#1_98|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|) (= (mod v_~isNull_1~0_83 256) 0) (= v_~result_8~0_166 (ite .cse3 |v_thread2Thread1of1ForFork1_minus_#res#1_84| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_29| 0) (= (ite (= (ite (not (= |v_thread2Thread1of1ForFork1_minus_#res#1_84| 0)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~stop~1#1_127|) .cse3 (= (select .cse0 (+ .cse2 v_~o_2~0.offset_135 4)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_81|) (= (select .cse0 (+ v_~o_2~0.offset_135 4)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_74|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#res#1_89|) |v_thread1Thread1of1ForFork0_minus_~a#1_95|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_98| |v_thread2Thread1of1ForFork1_minus_#in~a#1_74|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_98| |v_thread2Thread1of1ForFork1_minus_#in~b#1_76|) (= (select .cse1 (+ .cse2 4 v_~o_0~0.offset_109)) |v_thread1Thread1of1ForFork0_minus_#in~a#1_81|))) InVars {~o_2~0.offset=v_~o_2~0.offset_135, ~o_2~0.base=v_~o_2~0.base_135, ~isNull_3~0=v_~isNull_3~0_79, ~isNull_1~0=v_~isNull_1~0_83, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_200|, #memory_int=|v_#memory_int_254|, ~o_0~0.offset=v_~o_0~0.offset_109, ~o_0~0.base=v_~o_0~0.base_108, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_146|} OutVars{~o_2~0.offset=v_~o_2~0.offset_135, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_81|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_85|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_29|, ~o_0~0.base=v_~o_0~0.base_108, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_84|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_91|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_133|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_98|, ~result_5~0=v_~result_5~0_170, ~isNull_3~0=v_~isNull_3~0_79, ~isNull_1~0=v_~isNull_1~0_83, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_74|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, ~o_0~0.offset=v_~o_0~0.offset_109, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_84|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_76|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_89|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_98|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_75|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_137|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_127|, ~result_8~0=v_~result_8~0_166, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_84|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_88|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_81|, ~o_2~0.base=v_~o_2~0.base_135, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_29|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_198|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_95|, #memory_int=|v_#memory_int_254|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_80|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, ~result_5~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~ret7#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:43,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:15:43,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [907] L85-4-->L53-2: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_54| |v_thread1Thread1of1ForFork0_#t~mem1#1_86|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_54| (select (select |v_#memory_int_203| v_~o_2~0.base_99) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_135| 4) v_~o_2~0.offset_99))) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_68| |v_thread1Thread1of1ForFork0_minus_#res#1_62|) |v_thread1Thread1of1ForFork0_minus_~a#1_68|) (= |v_#pthreadsForks_71| (+ |v_#pthreadsForks_72| 1)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_68| |v_thread1Thread1of1ForFork0_minus_#in~b#1_54|) (= |v_ULTIMATE.start_main_#t~pre15#1_57| |v_#pthreadsForks_72|) (= |v_thread1Thread1of1ForFork0_~stop~0#1_89| (ite (= (ite (not (= v_~result_5~0_134 0)) 1 0) 0) 0 1)) (= (store |v_#memory_int_204| |v_ULTIMATE.start_main_~#t2~0#1.base_57| (store (select |v_#memory_int_204| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) |v_ULTIMATE.start_main_~#t2~0#1.offset_57| |v_ULTIMATE.start_main_#t~pre15#1_57|)) |v_#memory_int_203|) (= |v_thread1Thread1of1ForFork0_~i~0#1_134| (+ |v_thread1Thread1of1ForFork0_~i~0#1_135| 1)) (<= 0 (+ v_~result_5~0_134 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_68| |v_thread1Thread1of1ForFork0_minus_#in~a#1_54|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_68| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_68|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_68|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|) (<= v_~result_5~0_134 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|) (= v_~result_5~0_134 |v_thread1Thread1of1ForFork0_minus_#res#1_62|)) InVars {~o_2~0.offset=v_~o_2~0.offset_99, ~o_2~0.base=v_~o_2~0.base_99, #pthreadsForks=|v_#pthreadsForks_72|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_57|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_135|, #memory_int=|v_#memory_int_204|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|} OutVars{~o_2~0.offset=v_~o_2~0.offset_99, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_62|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_55|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_54|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_57|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_48|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_89|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_58|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_64|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_37|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_54|, ~o_2~0.base=v_~o_2~0.base_99, ~result_5~0=v_~result_5~0_134, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|, #pthreadsForks=|v_#pthreadsForks_71|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_68|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_134|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, #memory_int=|v_#memory_int_203|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #pthreadsForks, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:15:44,694 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:15:44,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2550 [2022-12-06 07:15:44,695 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 136 transitions, 1967 flow [2022-12-06 07:15:44,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:44,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:44,695 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:44,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:44,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 07:15:44,895 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash -363395005, now seen corresponding path program 1 times [2022-12-06 07:15:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:44,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284106083] [2022-12-06 07:15:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284106083] [2022-12-06 07:15:45,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284106083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:15:45,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:15:45,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:15:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428532939] [2022-12-06 07:15:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:15:45,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:15:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:45,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:15:45,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:15:45,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:15:45,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 136 transitions, 1967 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:45,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:45,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:15:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:45,637 INFO L130 PetriNetUnfolder]: 464/824 cut-off events. [2022-12-06 07:15:45,637 INFO L131 PetriNetUnfolder]: For 9248/9248 co-relation queries the response was YES. [2022-12-06 07:15:45,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 824 events. 464/824 cut-off events. For 9248/9248 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4018 event pairs, 147 based on Foata normal form. 4/828 useless extension candidates. Maximal degree in co-relation 5799. Up to 684 conditions per place. [2022-12-06 07:15:45,643 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 122 selfloop transitions, 29 changer transitions 2/153 dead transitions. [2022-12-06 07:15:45,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 153 transitions, 2407 flow [2022-12-06 07:15:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:15:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:15:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 07:15:45,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26495726495726496 [2022-12-06 07:15:45,644 INFO L175 Difference]: Start difference. First operand has 108 places, 136 transitions, 1967 flow. Second operand 6 states and 62 transitions. [2022-12-06 07:15:45,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 153 transitions, 2407 flow [2022-12-06 07:15:45,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 153 transitions, 2277 flow, removed 33 selfloop flow, removed 6 redundant places. [2022-12-06 07:15:45,667 INFO L231 Difference]: Finished difference. Result has 107 places, 134 transitions, 1871 flow [2022-12-06 07:15:45,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1871, PETRI_PLACES=107, PETRI_TRANSITIONS=134} [2022-12-06 07:15:45,668 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 84 predicate places. [2022-12-06 07:15:45,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:45,668 INFO L89 Accepts]: Start accepts. Operand has 107 places, 134 transitions, 1871 flow [2022-12-06 07:15:45,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:45,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:45,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 134 transitions, 1871 flow [2022-12-06 07:15:45,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 134 transitions, 1871 flow [2022-12-06 07:15:45,720 INFO L130 PetriNetUnfolder]: 207/477 cut-off events. [2022-12-06 07:15:45,720 INFO L131 PetriNetUnfolder]: For 4114/4136 co-relation queries the response was YES. [2022-12-06 07:15:45,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 477 events. 207/477 cut-off events. For 4114/4136 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2748 event pairs, 50 based on Foata normal form. 3/442 useless extension candidates. Maximal degree in co-relation 2864. Up to 168 conditions per place. [2022-12-06 07:15:45,724 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 134 transitions, 1871 flow [2022-12-06 07:15:45,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 07:15:45,725 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:15:45,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 07:15:45,726 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 134 transitions, 1871 flow [2022-12-06 07:15:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:45,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:45,726 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:45,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:15:45,726 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1328618112, now seen corresponding path program 1 times [2022-12-06 07:15:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:45,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135126268] [2022-12-06 07:15:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:46,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135126268] [2022-12-06 07:15:46,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135126268] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:46,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013558846] [2022-12-06 07:15:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:46,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:46,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:46,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:46,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:15:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:46,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 07:15:46,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:46,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:46,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:15:46,417 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-06 07:15:46,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 39 [2022-12-06 07:15:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 07:15:46,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:46,731 INFO L321 Elim1Store]: treesize reduction 54, result has 67.5 percent of original size [2022-12-06 07:15:46,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 160 [2022-12-06 07:15:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:46,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013558846] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:46,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:46,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 16 [2022-12-06 07:15:46,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857909191] [2022-12-06 07:15:46,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:46,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:15:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:15:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:15:46,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:15:46,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 134 transitions, 1871 flow. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:46,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:46,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:15:46,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:47,719 INFO L130 PetriNetUnfolder]: 514/907 cut-off events. [2022-12-06 07:15:47,719 INFO L131 PetriNetUnfolder]: For 9211/9211 co-relation queries the response was YES. [2022-12-06 07:15:47,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6321 conditions, 907 events. 514/907 cut-off events. For 9211/9211 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4510 event pairs, 81 based on Foata normal form. 16/923 useless extension candidates. Maximal degree in co-relation 6257. Up to 522 conditions per place. [2022-12-06 07:15:47,727 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 98 selfloop transitions, 82 changer transitions 14/194 dead transitions. [2022-12-06 07:15:47,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 2794 flow [2022-12-06 07:15:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:15:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:15:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2022-12-06 07:15:47,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1924342105263158 [2022-12-06 07:15:47,730 INFO L175 Difference]: Start difference. First operand has 106 places, 134 transitions, 1871 flow. Second operand 16 states and 117 transitions. [2022-12-06 07:15:47,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 2794 flow [2022-12-06 07:15:47,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 194 transitions, 2730 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 07:15:47,754 INFO L231 Difference]: Finished difference. Result has 124 places, 147 transitions, 2215 flow [2022-12-06 07:15:47,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1767, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2215, PETRI_PLACES=124, PETRI_TRANSITIONS=147} [2022-12-06 07:15:47,755 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 101 predicate places. [2022-12-06 07:15:47,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:47,755 INFO L89 Accepts]: Start accepts. Operand has 124 places, 147 transitions, 2215 flow [2022-12-06 07:15:47,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:47,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:47,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 147 transitions, 2215 flow [2022-12-06 07:15:47,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 147 transitions, 2215 flow [2022-12-06 07:15:47,817 INFO L130 PetriNetUnfolder]: 235/532 cut-off events. [2022-12-06 07:15:47,817 INFO L131 PetriNetUnfolder]: For 7297/7356 co-relation queries the response was YES. [2022-12-06 07:15:47,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 532 events. 235/532 cut-off events. For 7297/7356 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3107 event pairs, 54 based on Foata normal form. 4/490 useless extension candidates. Maximal degree in co-relation 3873. Up to 194 conditions per place. [2022-12-06 07:15:47,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 147 transitions, 2215 flow [2022-12-06 07:15:47,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-06 07:15:47,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L53-2-->L54-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_55| 5) (= (select (select |v_#memory_int_93| v_~o_0~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_55| 4) v_~o_0~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem1#1_27|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_37| 256) 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_37|, ~o_0~0.offset=v_~o_0~0.offset_19, #memory_int=|v_#memory_int_93|, ~o_0~0.base=v_~o_0~0.base_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:15:48,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [943] L53-2-->L54-1: Formula: (let ((.cse1 (select |v_#memory_int_316| v_~o_0~0.base_140)) (.cse0 (* |v_thread1Thread1of1ForFork0_~i~0#1_262| 4))) (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_123| |v_thread1Thread1of1ForFork0_minus_#in~b#1_109|) (= (select (select |v_#memory_int_316| v_~o_2~0.base_166) (+ .cse0 v_~o_2~0.offset_166)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_109|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_191| 256) 0) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_109| |v_thread1Thread1of1ForFork0_minus_~a#1_123|) (= |v_thread1Thread1of1ForFork0_~stop~0#1_191| (ite (= (ite (not (= v_~result_5~0_208 0)) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_152| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_262| 1) |v_thread1Thread1of1ForFork0_~i~0#1_261|) (= (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_261| 4) v_~o_0~0.offset_142)) |v_thread1Thread1of1ForFork0_#t~mem1#1_199|) (= v_~result_5~0_208 |v_thread1Thread1of1ForFork0_minus_#res#1_117|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_123| |v_thread1Thread1of1ForFork0_minus_#res#1_117|) |v_thread1Thread1of1ForFork0_minus_~a#1_123|) (< |v_thread1Thread1of1ForFork0_~i~0#1_261| 5) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_192| 256) 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_123| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_123|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_123|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_152|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_109| (select .cse1 (+ .cse0 v_~o_0~0.offset_142))))) InVars {~o_2~0.offset=v_~o_2~0.offset_166, ~o_2~0.base=v_~o_2~0.base_166, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_262|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_192|, ~o_0~0.offset=v_~o_0~0.offset_142, #memory_int=|v_#memory_int_316|, ~o_0~0.base=v_~o_0~0.base_140} OutVars{~o_2~0.offset=v_~o_2~0.offset_166, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_117|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_109|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_191|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_103|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_113|, ~o_0~0.base=v_~o_0~0.base_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_119|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_109|, ~o_2~0.base=v_~o_2~0.base_166, ~result_5~0=v_~result_5~0_208, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_152|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, ~o_0~0.offset=v_~o_0~0.offset_142, #memory_int=|v_#memory_int_316|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_199|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [869] L67-2-->thread2EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_In_4| 256) 0)))) (and (= (ite .cse0 v_~result_8~0_In_7 0) v_~result_8~0_Out_16) (or (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 5)) .cse0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0))) InVars {thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_In_4|, ~result_8~0=v_~result_8~0_Out_16, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~result_8~0] [2022-12-06 07:15:48,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [943] L53-2-->L54-1: Formula: (let ((.cse1 (select |v_#memory_int_316| v_~o_0~0.base_140)) (.cse0 (* |v_thread1Thread1of1ForFork0_~i~0#1_262| 4))) (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_123| |v_thread1Thread1of1ForFork0_minus_#in~b#1_109|) (= (select (select |v_#memory_int_316| v_~o_2~0.base_166) (+ .cse0 v_~o_2~0.offset_166)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_109|) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_191| 256) 0) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_109| |v_thread1Thread1of1ForFork0_minus_~a#1_123|) (= |v_thread1Thread1of1ForFork0_~stop~0#1_191| (ite (= (ite (not (= v_~result_5~0_208 0)) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_152| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_262| 1) |v_thread1Thread1of1ForFork0_~i~0#1_261|) (= (select .cse1 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_261| 4) v_~o_0~0.offset_142)) |v_thread1Thread1of1ForFork0_#t~mem1#1_199|) (= v_~result_5~0_208 |v_thread1Thread1of1ForFork0_minus_#res#1_117|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_123| |v_thread1Thread1of1ForFork0_minus_#res#1_117|) |v_thread1Thread1of1ForFork0_minus_~a#1_123|) (< |v_thread1Thread1of1ForFork0_~i~0#1_261| 5) (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_192| 256) 0) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_123| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_123|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_123|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_152|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_109| (select .cse1 (+ .cse0 v_~o_0~0.offset_142))))) InVars {~o_2~0.offset=v_~o_2~0.offset_166, ~o_2~0.base=v_~o_2~0.base_166, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_262|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_192|, ~o_0~0.offset=v_~o_0~0.offset_142, #memory_int=|v_#memory_int_316|, ~o_0~0.base=v_~o_0~0.base_140} OutVars{~o_2~0.offset=v_~o_2~0.offset_166, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_117|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_109|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_191|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_103|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_113|, ~o_0~0.base=v_~o_0~0.base_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_119|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_109|, ~o_2~0.base=v_~o_2~0.base_166, ~result_5~0=v_~result_5~0_208, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_152|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, ~o_0~0.offset=v_~o_0~0.offset_142, #memory_int=|v_#memory_int_316|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_199|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] and [885] L67-2-->L67-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_62|))) (and (= (select (select |v_#memory_int_139| v_~o_2~0.base_67) (+ .cse0 v_~o_2~0.offset_67)) |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|) (= (mod |v_thread2Thread1of1ForFork1_~stop~1#1_56| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (< |v_thread2Thread1of1ForFork1_~i~1#1_62| 5) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_33|)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_49|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_49| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_49|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (<= 0 (+ v_~result_8~0_80 2147483648)) (= (select (select |v_#memory_int_139| v_~o_0~0.base_43) (+ .cse0 v_~o_0~0.offset_43)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (<= v_~result_8~0_80 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_49| |v_thread2Thread1of1ForFork1_minus_#in~b#1_27|) (= v_~result_8~0_80 |v_thread2Thread1of1ForFork1_minus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_~stop~1#1_55| (ite (= (ite (not (= v_~result_8~0_80 0)) 1 0) 0) 0 1)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_62|) |v_thread2Thread1of1ForFork1_~i~1#1_61|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_49| |v_thread2Thread1of1ForFork1_minus_#in~a#1_25|))) InVars {~o_2~0.offset=v_~o_2~0.offset_67, ~o_2~0.base=v_~o_2~0.base_67, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_56|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_62|} OutVars{~o_2~0.offset=v_~o_2~0.offset_67, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~o_0~0.base=v_~o_0~0.base_43, thread2Thread1of1ForFork1_~stop~1#1=|v_thread2Thread1of1ForFork1_~stop~1#1_55|, ~result_8~0=v_~result_8~0_80, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, thread2Thread1of1ForFork1_#t~ret7#1=|v_thread2Thread1of1ForFork1_#t~ret7#1_39|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, ~o_2~0.base=v_~o_2~0.base_67, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_31|, ~o_0~0.offset=v_~o_0~0.offset_43, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~stop~1#1, ~result_8~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret7#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_minus_#in~b#1] [2022-12-06 07:15:49,083 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:15:49,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1329 [2022-12-06 07:15:49,084 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 2285 flow [2022-12-06 07:15:49,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:49,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:49,084 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:49,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:49,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 07:15:49,289 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -820841394, now seen corresponding path program 2 times [2022-12-06 07:15:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:49,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138419720] [2022-12-06 07:15:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:49,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138419720] [2022-12-06 07:15:49,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138419720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:49,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156099988] [2022-12-06 07:15:49,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:15:49,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:49,831 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:49,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:15:49,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:15:49,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:15:49,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 07:15:49,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:50,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:15:50,059 INFO L321 Elim1Store]: treesize reduction 101, result has 32.7 percent of original size [2022-12-06 07:15:50,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 73 [2022-12-06 07:15:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:50,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:50,463 INFO L321 Elim1Store]: treesize reduction 54, result has 67.5 percent of original size [2022-12-06 07:15:50,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 160 [2022-12-06 07:15:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:50,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156099988] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:50,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:50,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 18 [2022-12-06 07:15:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066805041] [2022-12-06 07:15:50,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:50,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:15:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:50,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:15:50,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:15:50,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:15:50,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 147 transitions, 2285 flow. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:50,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:50,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:15:50,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:51,433 INFO L130 PetriNetUnfolder]: 532/945 cut-off events. [2022-12-06 07:15:51,433 INFO L131 PetriNetUnfolder]: For 14541/14541 co-relation queries the response was YES. [2022-12-06 07:15:51,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7715 conditions, 945 events. 532/945 cut-off events. For 14541/14541 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4818 event pairs, 74 based on Foata normal form. 11/956 useless extension candidates. Maximal degree in co-relation 7634. Up to 524 conditions per place. [2022-12-06 07:15:51,441 INFO L137 encePairwiseOnDemand]: 11/43 looper letters, 101 selfloop transitions, 95 changer transitions 7/203 dead transitions. [2022-12-06 07:15:51,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 203 transitions, 3218 flow [2022-12-06 07:15:51,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:15:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:15:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 123 transitions. [2022-12-06 07:15:51,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16826265389876882 [2022-12-06 07:15:51,443 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 2285 flow. Second operand 17 states and 123 transitions. [2022-12-06 07:15:51,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 203 transitions, 3218 flow [2022-12-06 07:15:51,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 203 transitions, 2870 flow, removed 108 selfloop flow, removed 11 redundant places. [2022-12-06 07:15:51,473 INFO L231 Difference]: Finished difference. Result has 127 places, 155 transitions, 2318 flow [2022-12-06 07:15:51,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2318, PETRI_PLACES=127, PETRI_TRANSITIONS=155} [2022-12-06 07:15:51,474 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 104 predicate places. [2022-12-06 07:15:51,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:51,474 INFO L89 Accepts]: Start accepts. Operand has 127 places, 155 transitions, 2318 flow [2022-12-06 07:15:51,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:51,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:51,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 155 transitions, 2318 flow [2022-12-06 07:15:51,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 155 transitions, 2318 flow [2022-12-06 07:15:51,531 INFO L130 PetriNetUnfolder]: 246/560 cut-off events. [2022-12-06 07:15:51,531 INFO L131 PetriNetUnfolder]: For 8141/8214 co-relation queries the response was YES. [2022-12-06 07:15:51,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4379 conditions, 560 events. 246/560 cut-off events. For 8141/8214 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3365 event pairs, 54 based on Foata normal form. 5/523 useless extension candidates. Maximal degree in co-relation 4308. Up to 196 conditions per place. [2022-12-06 07:15:51,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 155 transitions, 2318 flow [2022-12-06 07:15:51,537 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 07:15:52,224 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:15:52,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 751 [2022-12-06 07:15:52,225 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 154 transitions, 2317 flow [2022-12-06 07:15:52,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:52,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:52,225 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:52,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:52,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:15:52,428 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1734261235, now seen corresponding path program 1 times [2022-12-06 07:15:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:52,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155993694] [2022-12-06 07:15:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:52,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:52,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155993694] [2022-12-06 07:15:52,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155993694] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:52,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228705131] [2022-12-06 07:15:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:52,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:52,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:52,881 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:52,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:15:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:52,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:15:52,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:53,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:53,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 34 [2022-12-06 07:15:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:53,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:53,213 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-06 07:15:53,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 95 [2022-12-06 07:15:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:53,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228705131] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:53,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:53,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 15 [2022-12-06 07:15:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148799135] [2022-12-06 07:15:53,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:53,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:15:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:53,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:15:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:15:53,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:15:53,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 154 transitions, 2317 flow. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:53,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:53,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:15:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:53,647 INFO L130 PetriNetUnfolder]: 526/916 cut-off events. [2022-12-06 07:15:53,648 INFO L131 PetriNetUnfolder]: For 16793/16793 co-relation queries the response was YES. [2022-12-06 07:15:53,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7830 conditions, 916 events. 526/916 cut-off events. For 16793/16793 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4458 event pairs, 162 based on Foata normal form. 20/936 useless extension candidates. Maximal degree in co-relation 7751. Up to 780 conditions per place. [2022-12-06 07:15:53,656 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 129 selfloop transitions, 34 changer transitions 0/163 dead transitions. [2022-12-06 07:15:53,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 163 transitions, 2727 flow [2022-12-06 07:15:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:15:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:15:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 07:15:53,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23255813953488372 [2022-12-06 07:15:53,657 INFO L175 Difference]: Start difference. First operand has 123 places, 154 transitions, 2317 flow. Second operand 6 states and 60 transitions. [2022-12-06 07:15:53,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 163 transitions, 2727 flow [2022-12-06 07:15:53,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 163 transitions, 2469 flow, removed 65 selfloop flow, removed 13 redundant places. [2022-12-06 07:15:53,689 INFO L231 Difference]: Finished difference. Result has 116 places, 152 transitions, 2119 flow [2022-12-06 07:15:53,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2119, PETRI_PLACES=116, PETRI_TRANSITIONS=152} [2022-12-06 07:15:53,689 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 93 predicate places. [2022-12-06 07:15:53,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:53,689 INFO L89 Accepts]: Start accepts. Operand has 116 places, 152 transitions, 2119 flow [2022-12-06 07:15:53,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:53,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:53,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 152 transitions, 2119 flow [2022-12-06 07:15:53,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 152 transitions, 2119 flow [2022-12-06 07:15:53,755 INFO L130 PetriNetUnfolder]: 242/552 cut-off events. [2022-12-06 07:15:53,755 INFO L131 PetriNetUnfolder]: For 7473/7524 co-relation queries the response was YES. [2022-12-06 07:15:53,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 552 events. 242/552 cut-off events. For 7473/7524 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3281 event pairs, 48 based on Foata normal form. 3/514 useless extension candidates. Maximal degree in co-relation 4045. Up to 182 conditions per place. [2022-12-06 07:15:53,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 152 transitions, 2119 flow [2022-12-06 07:15:53,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 07:15:53,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:15:53,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:15:53,765 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 152 transitions, 2119 flow [2022-12-06 07:15:53,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:53,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:53,765 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:53,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:53,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 07:15:53,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2008033595, now seen corresponding path program 1 times [2022-12-06 07:15:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:53,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723671602] [2022-12-06 07:15:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:15:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723671602] [2022-12-06 07:15:54,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723671602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638218109] [2022-12-06 07:15:54,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:54,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:54,807 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:54,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:15:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:54,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 07:15:54,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:55,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:15:55,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:15:55,091 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 07:15:55,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 07:15:55,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:55,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 07:15:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:55,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:55,725 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-06 07:15:55,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 279 [2022-12-06 07:15:55,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:55,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 222 [2022-12-06 07:15:55,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:55,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 214 [2022-12-06 07:15:55,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:55,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 206 [2022-12-06 07:15:55,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:55,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 198 [2022-12-06 07:15:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:56,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638218109] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:56,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:56,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 30 [2022-12-06 07:15:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401570598] [2022-12-06 07:15:56,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:56,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 07:15:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 07:15:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=871, Unknown=6, NotChecked=0, Total=992 [2022-12-06 07:15:56,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:15:56,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 152 transitions, 2119 flow. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:56,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:56,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:15:56,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:15:58,106 INFO L130 PetriNetUnfolder]: 674/1172 cut-off events. [2022-12-06 07:15:58,106 INFO L131 PetriNetUnfolder]: For 17753/17753 co-relation queries the response was YES. [2022-12-06 07:15:58,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9636 conditions, 1172 events. 674/1172 cut-off events. For 17753/17753 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6050 event pairs, 92 based on Foata normal form. 1/1173 useless extension candidates. Maximal degree in co-relation 9563. Up to 674 conditions per place. [2022-12-06 07:15:58,138 INFO L137 encePairwiseOnDemand]: 16/42 looper letters, 125 selfloop transitions, 79 changer transitions 4/208 dead transitions. [2022-12-06 07:15:58,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 208 transitions, 3230 flow [2022-12-06 07:15:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:15:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:15:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-12-06 07:15:58,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20714285714285716 [2022-12-06 07:15:58,139 INFO L175 Difference]: Start difference. First operand has 116 places, 152 transitions, 2119 flow. Second operand 10 states and 87 transitions. [2022-12-06 07:15:58,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 208 transitions, 3230 flow [2022-12-06 07:15:58,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 208 transitions, 3116 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 07:15:58,167 INFO L231 Difference]: Finished difference. Result has 124 places, 178 transitions, 2702 flow [2022-12-06 07:15:58,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2025, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2702, PETRI_PLACES=124, PETRI_TRANSITIONS=178} [2022-12-06 07:15:58,167 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 101 predicate places. [2022-12-06 07:15:58,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:58,167 INFO L89 Accepts]: Start accepts. Operand has 124 places, 178 transitions, 2702 flow [2022-12-06 07:15:58,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:58,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:58,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 178 transitions, 2702 flow [2022-12-06 07:15:58,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 178 transitions, 2702 flow [2022-12-06 07:15:58,236 INFO L130 PetriNetUnfolder]: 294/679 cut-off events. [2022-12-06 07:15:58,237 INFO L131 PetriNetUnfolder]: For 8040/8114 co-relation queries the response was YES. [2022-12-06 07:15:58,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5002 conditions, 679 events. 294/679 cut-off events. For 8040/8114 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4356 event pairs, 63 based on Foata normal form. 4/630 useless extension candidates. Maximal degree in co-relation 4933. Up to 222 conditions per place. [2022-12-06 07:15:58,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 178 transitions, 2702 flow [2022-12-06 07:15:58,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-06 07:15:58,244 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:15:58,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:15:58,245 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 178 transitions, 2702 flow [2022-12-06 07:15:58,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:58,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:58,245 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:58,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 07:15:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:58,445 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:15:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1633439954, now seen corresponding path program 1 times [2022-12-06 07:15:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:58,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739281334] [2022-12-06 07:15:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739281334] [2022-12-06 07:15:58,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739281334] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:58,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688141492] [2022-12-06 07:15:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:58,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:58,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:58,901 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:58,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 07:15:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:59,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 07:15:59,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:15:59,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:15:59,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-06 07:15:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:59,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:15:59,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:59,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 243 [2022-12-06 07:15:59,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:15:59,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 173 [2022-12-06 07:15:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 07:15:59,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688141492] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:15:59,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:15:59,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2022-12-06 07:15:59,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947418164] [2022-12-06 07:15:59,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:15:59,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:15:59,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:15:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:15:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:15:59,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:15:59,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 178 transitions, 2702 flow. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:15:59,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:15:59,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:15:59,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:16:00,697 INFO L130 PetriNetUnfolder]: 698/1222 cut-off events. [2022-12-06 07:16:00,698 INFO L131 PetriNetUnfolder]: For 17627/17627 co-relation queries the response was YES. [2022-12-06 07:16:00,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10164 conditions, 1222 events. 698/1222 cut-off events. For 17627/17627 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6477 event pairs, 100 based on Foata normal form. 8/1230 useless extension candidates. Maximal degree in co-relation 10087. Up to 618 conditions per place. [2022-12-06 07:16:00,707 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 121 selfloop transitions, 103 changer transitions 6/230 dead transitions. [2022-12-06 07:16:00,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 230 transitions, 3798 flow [2022-12-06 07:16:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:16:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:16:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-12-06 07:16:00,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20714285714285716 [2022-12-06 07:16:00,708 INFO L175 Difference]: Start difference. First operand has 124 places, 178 transitions, 2702 flow. Second operand 10 states and 87 transitions. [2022-12-06 07:16:00,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 230 transitions, 3798 flow [2022-12-06 07:16:00,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 230 transitions, 3681 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-06 07:16:00,744 INFO L231 Difference]: Finished difference. Result has 133 places, 190 transitions, 3187 flow [2022-12-06 07:16:00,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3187, PETRI_PLACES=133, PETRI_TRANSITIONS=190} [2022-12-06 07:16:00,744 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 110 predicate places. [2022-12-06 07:16:00,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:16:00,745 INFO L89 Accepts]: Start accepts. Operand has 133 places, 190 transitions, 3187 flow [2022-12-06 07:16:00,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:16:00,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:16:00,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 190 transitions, 3187 flow [2022-12-06 07:16:00,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 190 transitions, 3187 flow [2022-12-06 07:16:00,823 INFO L130 PetriNetUnfolder]: 309/717 cut-off events. [2022-12-06 07:16:00,823 INFO L131 PetriNetUnfolder]: For 9926/9995 co-relation queries the response was YES. [2022-12-06 07:16:00,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 717 events. 309/717 cut-off events. For 9926/9995 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4662 event pairs, 63 based on Foata normal form. 5/670 useless extension candidates. Maximal degree in co-relation 5566. Up to 235 conditions per place. [2022-12-06 07:16:00,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 190 transitions, 3187 flow [2022-12-06 07:16:00,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 07:16:00,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [875] L53-2-->thread1EXIT: Formula: (let ((.cse0 (not (= (mod |v_thread1Thread1of1ForFork0_~stop~0#1_In_3| 256) 0)))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_6| 0) (= (ite .cse0 v_~result_5~0_In_9 0) v_~result_5~0_Out_26) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_6| 0) (or .cse0 (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_9| 5))))) InVars {~result_5~0=v_~result_5~0_In_9, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_In_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_9|} OutVars{~result_5~0=v_~result_5~0_Out_26, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_6|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_In_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_9|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_6|} AuxVars[] AssignedVars[~result_5~0, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_54|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-06 07:16:00,896 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 07:16:00,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:16:00,898 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 07:16:00,898 INFO L89 Accepts]: Start accepts. Operand has 131 places, 189 transitions, 3185 flow [2022-12-06 07:16:00,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:16:00,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 07:16:01,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:16:01,104 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:16:01,106 INFO L158 Benchmark]: Toolchain (without parser) took 87405.77ms. Allocated memory was 192.9MB in the beginning and 414.2MB in the end (delta: 221.2MB). Free memory was 152.4MB in the beginning and 159.5MB in the end (delta: -7.2MB). Peak memory consumption was 214.6MB. Max. memory is 8.0GB. [2022-12-06 07:16:01,106 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 169.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:16:01,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.90ms. Allocated memory is still 192.9MB. Free memory was 151.8MB in the beginning and 140.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:16:01,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.04ms. Allocated memory is still 192.9MB. Free memory was 140.3MB in the beginning and 138.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:16:01,107 INFO L158 Benchmark]: Boogie Preprocessor took 18.87ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:16:01,107 INFO L158 Benchmark]: RCFGBuilder took 474.55ms. Allocated memory is still 192.9MB. Free memory was 136.1MB in the beginning and 115.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 07:16:01,107 INFO L158 Benchmark]: TraceAbstraction took 86643.34ms. Allocated memory was 192.9MB in the beginning and 414.2MB in the end (delta: 221.2MB). Free memory was 114.6MB in the beginning and 159.5MB in the end (delta: -44.9MB). Peak memory consumption was 176.9MB. Max. memory is 8.0GB. [2022-12-06 07:16:01,109 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 169.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.90ms. Allocated memory is still 192.9MB. Free memory was 151.8MB in the beginning and 140.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.04ms. Allocated memory is still 192.9MB. Free memory was 140.3MB in the beginning and 138.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.87ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 474.55ms. Allocated memory is still 192.9MB. Free memory was 136.1MB in the beginning and 115.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 86643.34ms. Allocated memory was 192.9MB in the beginning and 414.2MB in the end (delta: 221.2MB). Free memory was 114.6MB in the beginning and 159.5MB in the end (delta: -44.9MB). Peak memory consumption was 176.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 203 PlacesBefore, 23 PlacesAfterwards, 217 TransitionsBefore, 20 TransitionsAfterwards, 5400 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 98 TrivialYvCompositions, 82 ConcurrentYvCompositions, 17 ChoiceCompositions, 197 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 3467, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3479, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3116, unknown conditional: 0, unknown unconditional: 3116] , Statistics on independence cache: Total cache size (in pairs): 6784, Positive cache size: 6775, Positive conditional cache size: 0, Positive unconditional cache size: 6775, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 17, Positive conditional cache size: 5, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 15, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 31, independent conditional: 15, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 15, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 25, independent conditional: 9, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 25, Positive conditional cache size: 11, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 59 PlacesBefore, 60 PlacesAfterwards, 48 TransitionsBefore, 44 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 18, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 18, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 47, Positive conditional cache size: 29, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 62 PlacesBefore, 59 PlacesAfterwards, 49 TransitionsBefore, 46 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 52, Positive conditional cache size: 34, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 72 PlacesBefore, 71 PlacesAfterwards, 67 TransitionsBefore, 65 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 56, Positive conditional cache size: 36, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 85 PlacesBefore, 83 PlacesAfterwards, 81 TransitionsBefore, 79 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 61, Positive conditional cache size: 41, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 97 PlacesBefore, 94 PlacesAfterwards, 114 TransitionsBefore, 110 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 180, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 66, Positive conditional cache size: 46, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 108 PlacesBefore, 108 PlacesAfterwards, 137 TransitionsBefore, 136 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 68, Positive conditional cache size: 48, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 68, Positive conditional cache size: 48, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 120 PlacesBefore, 120 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 70, Positive conditional cache size: 50, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 124 PlacesBefore, 123 PlacesAfterwards, 155 TransitionsBefore, 154 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 76, Positive conditional cache size: 56, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 152 TransitionsBefore, 152 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 76, Positive conditional cache size: 56, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 178 TransitionsBefore, 178 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 76, Positive conditional cache size: 56, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 132 PlacesBefore, 131 PlacesAfterwards, 190 TransitionsBefore, 189 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 78, Positive conditional cache size: 58, Positive unconditional cache size: 20, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:16:01,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...