/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/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:38:48,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:38:48,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:38:48,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:38:48,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:38:48,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:38:48,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:38:48,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:38:48,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:38:48,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:38:48,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:38:48,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:38:48,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:38:48,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:38:48,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:38:48,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:38:48,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:38:48,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:38:48,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:38:48,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:38:48,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:38:48,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:38:48,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:38:48,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:38:48,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:38:48,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:38:48,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:38:48,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:38:48,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:38:48,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:38:48,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:38:48,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:38:48,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:38:48,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:38:48,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:38:48,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:38:48,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:38:48,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:38:48,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:38:48,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:38:48,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:38:48,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 13:38:48,678 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:38:48,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:38:48,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:38:48,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:38:48,680 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:38:48,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:38:48,680 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:38:48,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:38:48,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:38:48,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:38:48,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:38:48,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:38:48,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:38:48,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 13:38:48,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:38:48,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:38:48,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:38:48,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:38:48,979 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:38:48,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-13 13:38:49,968 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:38:50,135 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:38:50,136 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-13 13:38:50,141 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc310be3/31fda522815c464d9bf875b890cb0db4/FLAG67575facb [2022-12-13 13:38:50,157 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc310be3/31fda522815c464d9bf875b890cb0db4 [2022-12-13 13:38:50,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:38:50,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:38:50,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:38:50,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:38:50,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:38:50,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2a8841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50, skipping insertion in model container [2022-12-13 13:38:50,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:38:50,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:38:50,319 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/unroll-2.wvr.c[2428,2441] [2022-12-13 13:38:50,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:38:50,331 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:38:50,346 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/unroll-2.wvr.c[2428,2441] [2022-12-13 13:38:50,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:38:50,362 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:38:50,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50 WrapperNode [2022-12-13 13:38:50,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:38:50,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:38:50,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:38:50,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:38:50,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,386 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-13 13:38:50,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:38:50,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:38:50,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:38:50,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:38:50,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,404 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:38:50,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:38:50,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:38:50,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:38:50,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (1/1) ... [2022-12-13 13:38:50,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:38:50,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:50,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:38:50,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:38:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:38:50,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:38:50,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:38:50,490 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:38:50,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:38:50,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:38:50,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:38:50,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:38:50,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:38:50,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:38:50,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:38:50,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:38:50,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:38:50,492 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:38:50,624 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:38:50,625 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:38:50,802 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:38:50,808 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:38:50,809 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 13:38:50,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:38:50 BoogieIcfgContainer [2022-12-13 13:38:50,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:38:50,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:38:50,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:38:50,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:38:50,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:38:50" (1/3) ... [2022-12-13 13:38:50,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223bb275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:38:50, skipping insertion in model container [2022-12-13 13:38:50,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:38:50" (2/3) ... [2022-12-13 13:38:50,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223bb275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:38:50, skipping insertion in model container [2022-12-13 13:38:50,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:38:50" (3/3) ... [2022-12-13 13:38:50,817 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-13 13:38:50,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:38:50,830 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:38:50,830 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:38:50,884 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 13:38:50,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 13:38:50,995 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-13 13:38:50,995 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:38:51,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 14/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 13:38:51,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-13 13:38:51,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-13 13:38:51,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:51,035 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 13:38:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-13 13:38:51,085 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-13 13:38:51,085 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:38:51,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 14/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 13:38:51,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-13 13:38:51,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-13 13:38:54,568 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 13:38:54,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:38:54,584 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;@69c641e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:38:54,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 13:38:54,587 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 13:38:54,587 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:38:54,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:54,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:54,588 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-13 13:38:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-13 13:38:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:54,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108880622] [2022-12-13 13:38:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:54,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:54,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108880622] [2022-12-13 13:38:54,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108880622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:54,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:54,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:38:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655109714] [2022-12-13 13:38:54,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:54,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:54,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:54,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:38:54,875 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 13:38:54,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 13:38:54,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:54,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 13:38:54,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:54,926 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-13 13:38:54,927 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 13:38:54,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-13 13:38:54,928 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 13:38:54,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 13:38:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:38:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 13:38:54,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 13:38:54,937 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-13 13:38:54,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 13:38:54,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:38:54,939 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-13 13:38:54,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-13 13:38:54,943 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 13:38:54,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:54,943 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 13:38:54,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:54,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:54,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 13:38:54,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 13:38:54,950 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 13:38:54,950 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:38:54,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-13 13:38:54,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 13:38:54,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 13:38:55,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:38:55,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 734 [2022-12-13 13:38:55,677 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-13 13:38:55,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-13 13:38:55,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:55,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:55,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:38:55,677 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-13 13:38:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-13 13:38:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:55,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794603040] [2022-12-13 13:38:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:55,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:55,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:55,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794603040] [2022-12-13 13:38:55,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794603040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:55,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:55,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:38:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9112555] [2022-12-13 13:38:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:55,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:38:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:38:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:38:55,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 13:38:55,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:55,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:55,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 13:38:55,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:55,955 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-13 13:38:55,955 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 13:38:55,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-13 13:38:55,958 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 13:38:55,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-13 13:38:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:38:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 13:38:55,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 13:38:55,959 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-13 13:38:55,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-13 13:38:55,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 13:38:55,960 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-13 13:38:55,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-13 13:38:55,961 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 13:38:55,961 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:55,961 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 13:38:55,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:55,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:55,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 13:38:55,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 13:38:55,966 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-13 13:38:55,966 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:38:55,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-13 13:38:55,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 13:38:55,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 13:38:55,970 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:55,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 13:38:55,971 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-13 13:38:55,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:55,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:55,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:55,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:38:55,972 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-13 13:38:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash 166108600, now seen corresponding path program 1 times [2022-12-13 13:38:55,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:55,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687832421] [2022-12-13 13:38:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:56,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:56,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687832421] [2022-12-13 13:38:56,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687832421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:56,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:56,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:38:56,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358112056] [2022-12-13 13:38:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:56,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:38:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:38:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:38:56,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 13:38:56,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 13:38:56,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:56,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 13:38:56,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:56,127 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-13 13:38:56,128 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 13:38:56,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 169 events. 87/169 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 517 event pairs, 30 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 132. Up to 98 conditions per place. [2022-12-13 13:38:56,149 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 6/40 dead transitions. [2022-12-13 13:38:56,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 40 transitions, 193 flow [2022-12-13 13:38:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:38:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:38:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-13 13:38:56,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-13 13:38:56,151 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 39 transitions. [2022-12-13 13:38:56,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 40 transitions, 193 flow [2022-12-13 13:38:56,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 40 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:38:56,152 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-13 13:38:56,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-13 13:38:56,152 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 13:38:56,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:56,153 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-13 13:38:56,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:56,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:56,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-13 13:38:56,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-13 13:38:56,160 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-13 13:38:56,160 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 13:38:56,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 34 events. 7/34 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 46. Up to 11 conditions per place. [2022-12-13 13:38:56,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-13 13:38:56,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 13:38:56,351 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:38:56,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-13 13:38:56,352 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-13 13:38:56,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-13 13:38:56,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:56,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:56,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:38:56,353 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-13 13:38:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1536303008, now seen corresponding path program 1 times [2022-12-13 13:38:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872474345] [2022-12-13 13:38:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:56,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:56,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872474345] [2022-12-13 13:38:56,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872474345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:56,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462206888] [2022-12-13 13:38:56,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:56,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:56,507 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-13 13:38:56,537 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-13 13:38:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:56,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:38:56,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:56,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:38:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462206888] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:56,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:38:56,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-13 13:38:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470528499] [2022-12-13 13:38:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:56,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:38:56,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 13:38:56,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:56,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:56,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 13:38:56,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:56,670 INFO L130 PetriNetUnfolder]: 59/109 cut-off events. [2022-12-13 13:38:56,670 INFO L131 PetriNetUnfolder]: For 168/174 co-relation queries the response was YES. [2022-12-13 13:38:56,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 109 events. 59/109 cut-off events. For 168/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 299 event pairs, 10 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 203. Up to 76 conditions per place. [2022-12-13 13:38:56,670 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-12-13 13:38:56,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-13 13:38:56,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:38:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 13:38:56,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 13:38:56,671 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-13 13:38:56,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-13 13:38:56,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 27 transitions, 135 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 13:38:56,673 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-13 13:38:56,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 13:38:56,673 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 13:38:56,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:56,673 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-13 13:38:56,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:56,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:56,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-13 13:38:56,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-13 13:38:56,676 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-13 13:38:56,677 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 13:38:56,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 27 events. 7/27 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-13 13:38:56,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-13 13:38:56,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 13:38:56,677 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:56,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 13:38:56,678 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-13 13:38:56,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:56,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:56,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:56,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 13:38:56,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:56,884 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-13 13:38:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash -774279310, now seen corresponding path program 1 times [2022-12-13 13:38:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104772727] [2022-12-13 13:38:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:56,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104772727] [2022-12-13 13:38:56,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104772727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:56,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:56,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:38:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643261893] [2022-12-13 13:38:56,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:56,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:38:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:56,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:38:56,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:38:56,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 13:38:56,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:56,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:56,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 13:38:56,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:57,010 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-13 13:38:57,010 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-13 13:38:57,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 119 events. 61/119 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 308 event pairs, 20 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 125. Up to 76 conditions per place. [2022-12-13 13:38:57,012 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-13 13:38:57,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 184 flow [2022-12-13 13:38:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:38:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:38:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 13:38:57,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 13:38:57,014 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-13 13:38:57,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 35 transitions, 184 flow [2022-12-13 13:38:57,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 35 transitions, 169 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 13:38:57,018 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-13 13:38:57,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-13 13:38:57,020 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 13:38:57,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:57,020 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 13:38:57,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:57,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:57,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 13:38:57,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 13:38:57,025 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-13 13:38:57,025 INFO L131 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2022-12-13 13:38:57,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 31 events. 6/31 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 39. Up to 9 conditions per place. [2022-12-13 13:38:57,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 13:38:57,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 13:38:57,190 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:38:57,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 13:38:57,191 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-13 13:38:57,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:57,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:57,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:38:57,192 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-13 13:38:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1396315567, now seen corresponding path program 1 times [2022-12-13 13:38:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:57,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162715054] [2022-12-13 13:38:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162715054] [2022-12-13 13:38:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162715054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:57,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:57,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:38:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216860820] [2022-12-13 13:38:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:57,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:38:57,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 13:38:57,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:57,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:57,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 13:38:57,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:57,321 INFO L130 PetriNetUnfolder]: 44/84 cut-off events. [2022-12-13 13:38:57,321 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-13 13:38:57,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 84 events. 44/84 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 179 event pairs, 11 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 165. Up to 68 conditions per place. [2022-12-13 13:38:57,322 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 3/25 dead transitions. [2022-12-13 13:38:57,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 143 flow [2022-12-13 13:38:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:38:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 13:38:57,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 13:38:57,323 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 26 transitions. [2022-12-13 13:38:57,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 143 flow [2022-12-13 13:38:57,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 126 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 13:38:57,325 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-13 13:38:57,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2022-12-13 13:38:57,327 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 13:38:57,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:57,328 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-13 13:38:57,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:57,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:57,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-13 13:38:57,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-13 13:38:57,331 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-13 13:38:57,331 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:38:57,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 6/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 9 conditions per place. [2022-12-13 13:38:57,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-13 13:38:57,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 13:38:57,332 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:57,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 13:38:57,335 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-13 13:38:57,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:57,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:57,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:57,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:38:57,335 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-13 13:38:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1385749717, now seen corresponding path program 1 times [2022-12-13 13:38:57,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:57,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144666237] [2022-12-13 13:38:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:57,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144666237] [2022-12-13 13:38:57,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144666237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:57,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:57,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:38:57,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332001174] [2022-12-13 13:38:57,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:57,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:38:57,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:38:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:38:57,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 13:38:57,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:57,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:57,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 13:38:57,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:57,473 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-13 13:38:57,473 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 13:38:57,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 119 events. 61/119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 316 event pairs, 16 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 265. Up to 76 conditions per place. [2022-12-13 13:38:57,474 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-13 13:38:57,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 176 flow [2022-12-13 13:38:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:38:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:38:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 13:38:57,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-13 13:38:57,475 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-13 13:38:57,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 176 flow [2022-12-13 13:38:57,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 13:38:57,475 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 87 flow [2022-12-13 13:38:57,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-13 13:38:57,476 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 13:38:57,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:57,476 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 87 flow [2022-12-13 13:38:57,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:57,477 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:57,477 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-13 13:38:57,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 87 flow [2022-12-13 13:38:57,480 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-13 13:38:57,480 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 13:38:57,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 37 events. 8/37 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 53. Up to 13 conditions per place. [2022-12-13 13:38:57,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-13 13:38:57,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 13:38:57,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:57,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 13:38:57,481 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 87 flow [2022-12-13 13:38:57,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:57,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:57,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:57,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:38:57,482 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-13 13:38:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1328554519, now seen corresponding path program 2 times [2022-12-13 13:38:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:57,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239351636] [2022-12-13 13:38:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:57,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:57,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239351636] [2022-12-13 13:38:57,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239351636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:57,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:57,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:38:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120714919] [2022-12-13 13:38:57,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:57,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:38:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:57,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:38:57,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:38:57,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 13:38:57,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:57,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:57,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 13:38:57,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:57,602 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-13 13:38:57,602 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 13:38:57,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 94 events. 52/94 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 148. Up to 76 conditions per place. [2022-12-13 13:38:57,603 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2022-12-13 13:38:57,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 154 flow [2022-12-13 13:38:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:38:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 13:38:57,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 13:38:57,604 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 87 flow. Second operand 3 states and 27 transitions. [2022-12-13 13:38:57,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 154 flow [2022-12-13 13:38:57,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 141 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 13:38:57,605 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2022-12-13 13:38:57,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-13 13:38:57,605 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 13:38:57,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:57,605 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 78 flow [2022-12-13 13:38:57,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:57,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:57,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-13 13:38:57,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 78 flow [2022-12-13 13:38:57,609 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-13 13:38:57,609 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 13:38:57,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 8/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-13 13:38:57,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-13 13:38:57,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 13:38:57,615 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:38:57,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 13:38:57,615 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-13 13:38:57,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:57,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:57,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:57,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:38:57,616 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-13 13:38:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2064777642, now seen corresponding path program 1 times [2022-12-13 13:38:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128273465] [2022-12-13 13:38:57,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128273465] [2022-12-13 13:38:57,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128273465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369928878] [2022-12-13 13:38:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:57,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:57,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:57,896 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-13 13:38:57,898 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-13 13:38:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:57,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 13:38:57,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:57,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:38:58,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:38:58,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:38:58,092 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-13 13:38:58,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 35 [2022-12-13 13:38:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:58,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:38:58,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (< .cse0 0) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (= (select .cse1 (+ c_~f~0.offset (* .cse0 4))) (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset))))))) is different from false [2022-12-13 13:38:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:58,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369928878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:38:58,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:38:58,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:38:58,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902375818] [2022-12-13 13:38:58,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:38:58,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:38:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:58,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:38:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2022-12-13 13:38:58,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 13:38:58,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:58,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:58,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 13:38:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:38:58,677 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2022-12-13 13:38:58,677 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 13:38:58,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 218 events. 121/218 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 682 event pairs, 14 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 110. Up to 105 conditions per place. [2022-12-13 13:38:58,678 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 20 selfloop transitions, 4 changer transitions 37/61 dead transitions. [2022-12-13 13:38:58,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 61 transitions, 343 flow [2022-12-13 13:38:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:38:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:38:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-13 13:38:58,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-13 13:38:58,681 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 9 states and 60 transitions. [2022-12-13 13:38:58,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 61 transitions, 343 flow [2022-12-13 13:38:58,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 61 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:38:58,682 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 100 flow [2022-12-13 13:38:58,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 13:38:58,683 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 13:38:58,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:58,683 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 100 flow [2022-12-13 13:38:58,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:58,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:58,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 100 flow [2022-12-13 13:38:58,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 100 flow [2022-12-13 13:38:58,688 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-13 13:38:58,688 INFO L131 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2022-12-13 13:38:58,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 30 events. 8/30 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 71. Up to 13 conditions per place. [2022-12-13 13:38:58,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 100 flow [2022-12-13 13:38:58,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 13:38:59,603 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:38:59,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 921 [2022-12-13 13:38:59,604 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 96 flow [2022-12-13 13:38:59,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:59,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:59,604 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:59,612 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-13 13:38:59,804 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,SelfDestructingSolverStorable8 [2022-12-13 13:38:59,805 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-13 13:38:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash -380380717, now seen corresponding path program 1 times [2022-12-13 13:38:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:59,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938385638] [2022-12-13 13:38:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938385638] [2022-12-13 13:39:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938385638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:00,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548159324] [2022-12-13 13:39:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:00,386 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-13 13:39:00,413 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-13 13:39:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:00,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 13:39:00,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:00,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:00,529 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 13:39:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:00,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:00,604 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-13 13:39:00,605 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-13 13:39:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:00,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548159324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:00,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:00,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-13 13:39:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317744110] [2022-12-13 13:39:00,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:00,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:39:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:39:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:39:00,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 13:39:00,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 96 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:00,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:00,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 13:39:00,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:00,984 INFO L130 PetriNetUnfolder]: 139/255 cut-off events. [2022-12-13 13:39:00,984 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-13 13:39:00,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 255 events. 139/255 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 788 event pairs, 10 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 845. Up to 118 conditions per place. [2022-12-13 13:39:00,986 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 57 selfloop transitions, 25 changer transitions 1/83 dead transitions. [2022-12-13 13:39:00,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 507 flow [2022-12-13 13:39:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:39:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:39:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2022-12-13 13:39:00,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36403508771929827 [2022-12-13 13:39:00,987 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 96 flow. Second operand 12 states and 83 transitions. [2022-12-13 13:39:00,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 507 flow [2022-12-13 13:39:00,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 83 transitions, 437 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-13 13:39:00,989 INFO L231 Difference]: Finished difference. Result has 36 places, 44 transitions, 246 flow [2022-12-13 13:39:00,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=246, PETRI_PLACES=36, PETRI_TRANSITIONS=44} [2022-12-13 13:39:00,989 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 13:39:00,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:00,990 INFO L89 Accepts]: Start accepts. Operand has 36 places, 44 transitions, 246 flow [2022-12-13 13:39:00,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:00,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:00,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-13 13:39:00,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 44 transitions, 246 flow [2022-12-13 13:39:00,996 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-13 13:39:00,996 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-13 13:39:00,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 85 events. 24/85 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 167. Up to 36 conditions per place. [2022-12-13 13:39:00,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-13 13:39:00,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 13:39:01,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:01,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 13:39:02,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 13:39:02,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:02,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (<= 0 v_~x1~0_147) (< v_~x1~0_147 v_~size~0_116)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (store |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47| (store (select |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre12#1_54|)) |v_#memory_int_171|) (= (select (select |v_#memory_int_172| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~x1~0_147 4))) v_~x1~0_146) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_128| 1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_128| 4294967295) 4294967296) (* (mod v_~n~0_115 2147483648) 2)) (= |v_ULTIMATE.start_main_#t~pre12#1_54| |v_#pthreadsForks_68|) (= |v_#pthreadsForks_67| (+ |v_#pthreadsForks_68| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_68|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_172|, ~n~0=v_~n~0_115, ~x1~0=v_~x1~0_147, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ~f~0.offset=v_~f~0.offset_104} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, ~x1~0=v_~x1~0_146, ~f~0.offset=v_~f~0.offset_104, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_54|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_43|, #pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_57|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_128|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, ~n~0=v_~n~0_115, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:02,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_175| v_~f~0.base_106))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_106 (* v_~x2~0_116 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (ite (and (< .cse0 v_~size~0_118) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= v_~x1~0_150 (select .cse1 (+ v_~f~0.offset_106 (* v_~x1~0_151 4)))) (= v_~x2~0_115 (select .cse1 (+ v_~f~0.offset_106 (* .cse0 4)))) (= (ite (and (< v_~x1~0_151 v_~size~0_118) (<= 0 v_~x1~0_151)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_116) (< v_~x2~0_116 v_~size~0_118)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_130| 1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_95|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) (* 2 (mod v_~n~0_117 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0))))) InVars {~x2~0=v_~x2~0_116, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_117, ~x1~0=v_~x1~0_151, ~f~0.offset=v_~f~0.offset_106} OutVars{~x2~0=v_~x2~0_115, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_82|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_95|, ~x1~0=v_~x1~0_150, ~f~0.offset=v_~f~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_36|, ~n~0=v_~n~0_117, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_36|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_90|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:02,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_155| v_~f~0.base_90))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_90 (* v_~x2~0_112 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_100| 1) (= (ite (and (<= 0 v_~x1~0_109) (< v_~x1~0_109 v_~size~0_102)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 2 (mod v_~n~0_101 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_102)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= (ite (and (<= 0 v_~x2~0_112) (< v_~x2~0_112 v_~size~0_102)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (select .cse1 (+ v_~f~0.offset_90 (* .cse0 4))) v_~x2~0_111) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|) (= (select .cse1 (+ v_~f~0.offset_90 (* v_~x1~0_109 4))) v_~x1~0_108)))) InVars {~x2~0=v_~x2~0_112, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_101, ~x1~0=v_~x1~0_109, ~f~0.offset=v_~f~0.offset_90} OutVars{~x2~0=v_~x2~0_111, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_56|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_44|, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~x1~0=v_~x1~0_108, ~f~0.offset=v_~f~0.offset_90, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_100|, #memory_int=|v_#memory_int_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_34|, ~n~0=v_~n~0_101, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_34|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_64|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:05,096 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 13:39:05,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4107 [2022-12-13 13:39:05,097 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-13 13:39:05,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:05,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:05,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:05,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:39:05,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:05,298 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-13 13:39:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1202382836, now seen corresponding path program 1 times [2022-12-13 13:39:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289733534] [2022-12-13 13:39:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:05,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:05,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289733534] [2022-12-13 13:39:05,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289733534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:05,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:05,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:39:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853880118] [2022-12-13 13:39:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:05,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:39:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:05,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:39:05,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:39:05,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 13:39:05,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 42 transitions, 276 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:05,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:05,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 13:39:05,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:05,939 INFO L130 PetriNetUnfolder]: 151/272 cut-off events. [2022-12-13 13:39:05,939 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-13 13:39:05,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 272 events. 151/272 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 885 event pairs, 42 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 634. Up to 237 conditions per place. [2022-12-13 13:39:05,940 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 38 selfloop transitions, 14 changer transitions 2/54 dead transitions. [2022-12-13 13:39:05,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 425 flow [2022-12-13 13:39:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-13 13:39:05,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2022-12-13 13:39:05,941 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 5 states and 46 transitions. [2022-12-13 13:39:05,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 425 flow [2022-12-13 13:39:05,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 349 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:05,943 INFO L231 Difference]: Finished difference. Result has 37 places, 43 transitions, 251 flow [2022-12-13 13:39:05,943 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=37, PETRI_TRANSITIONS=43} [2022-12-13 13:39:05,944 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 13:39:05,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:05,944 INFO L89 Accepts]: Start accepts. Operand has 37 places, 43 transitions, 251 flow [2022-12-13 13:39:05,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:05,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:05,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 43 transitions, 251 flow [2022-12-13 13:39:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 43 transitions, 251 flow [2022-12-13 13:39:05,952 INFO L130 PetriNetUnfolder]: 25/88 cut-off events. [2022-12-13 13:39:05,952 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-13 13:39:05,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 88 events. 25/88 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 185. Up to 30 conditions per place. [2022-12-13 13:39:05,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 43 transitions, 251 flow [2022-12-13 13:39:05,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 13:39:05,953 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:05,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 13:39:05,955 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 43 transitions, 251 flow [2022-12-13 13:39:05,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:05,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:05,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:05,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:39:05,955 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-13 13:39:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1205008728, now seen corresponding path program 1 times [2022-12-13 13:39:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:05,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207536861] [2022-12-13 13:39:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:06,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207536861] [2022-12-13 13:39:06,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207536861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:06,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:06,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:39:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602645577] [2022-12-13 13:39:06,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:39:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:39:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:39:06,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:39:06,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 43 transitions, 251 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:06,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:06,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:39:06,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:06,687 INFO L130 PetriNetUnfolder]: 222/392 cut-off events. [2022-12-13 13:39:06,688 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-12-13 13:39:06,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 392 events. 222/392 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1459 event pairs, 30 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 883. Up to 256 conditions per place. [2022-12-13 13:39:06,690 INFO L137 encePairwiseOnDemand]: 9/29 looper letters, 43 selfloop transitions, 32 changer transitions 1/76 dead transitions. [2022-12-13 13:39:06,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 566 flow [2022-12-13 13:39:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:39:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:39:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 13:39:06,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3505747126436782 [2022-12-13 13:39:06,690 INFO L175 Difference]: Start difference. First operand has 36 places, 43 transitions, 251 flow. Second operand 6 states and 61 transitions. [2022-12-13 13:39:06,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 566 flow [2022-12-13 13:39:06,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 76 transitions, 533 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 13:39:06,694 INFO L231 Difference]: Finished difference. Result has 41 places, 60 transitions, 468 flow [2022-12-13 13:39:06,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=41, PETRI_TRANSITIONS=60} [2022-12-13 13:39:06,694 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-13 13:39:06,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:06,694 INFO L89 Accepts]: Start accepts. Operand has 41 places, 60 transitions, 468 flow [2022-12-13 13:39:06,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:06,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:06,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 60 transitions, 468 flow [2022-12-13 13:39:06,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 60 transitions, 468 flow [2022-12-13 13:39:06,704 INFO L130 PetriNetUnfolder]: 37/122 cut-off events. [2022-12-13 13:39:06,705 INFO L131 PetriNetUnfolder]: For 124/131 co-relation queries the response was YES. [2022-12-13 13:39:06,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 122 events. 37/122 cut-off events. For 124/131 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 0 based on Foata normal form. 3/118 useless extension candidates. Maximal degree in co-relation 314. Up to 42 conditions per place. [2022-12-13 13:39:06,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 60 transitions, 468 flow [2022-12-13 13:39:06,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-13 13:39:09,058 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:09,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2364 [2022-12-13 13:39:09,058 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 60 transitions, 474 flow [2022-12-13 13:39:09,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:09,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:09,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:09,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:39:09,059 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-13 13:39:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -7334795, now seen corresponding path program 1 times [2022-12-13 13:39:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:09,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027005279] [2022-12-13 13:39:09,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:09,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:09,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027005279] [2022-12-13 13:39:09,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027005279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:09,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:09,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:39:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518692872] [2022-12-13 13:39:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:09,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:39:09,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:39:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:39:09,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:39:09,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 60 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:09,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:09,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:39:09,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:09,228 INFO L130 PetriNetUnfolder]: 233/411 cut-off events. [2022-12-13 13:39:09,229 INFO L131 PetriNetUnfolder]: For 740/740 co-relation queries the response was YES. [2022-12-13 13:39:09,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 411 events. 233/411 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1534 event pairs, 96 based on Foata normal form. 8/399 useless extension candidates. Maximal degree in co-relation 1096. Up to 378 conditions per place. [2022-12-13 13:39:09,231 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 60 selfloop transitions, 6 changer transitions 1/67 dead transitions. [2022-12-13 13:39:09,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 643 flow [2022-12-13 13:39:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:39:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:39:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-13 13:39:09,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-13 13:39:09,232 INFO L175 Difference]: Start difference. First operand has 41 places, 60 transitions, 474 flow. Second operand 3 states and 39 transitions. [2022-12-13 13:39:09,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 643 flow [2022-12-13 13:39:09,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 637 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 13:39:09,235 INFO L231 Difference]: Finished difference. Result has 44 places, 60 transitions, 493 flow [2022-12-13 13:39:09,235 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=44, PETRI_TRANSITIONS=60} [2022-12-13 13:39:09,235 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 13:39:09,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:09,236 INFO L89 Accepts]: Start accepts. Operand has 44 places, 60 transitions, 493 flow [2022-12-13 13:39:09,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:09,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:09,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 60 transitions, 493 flow [2022-12-13 13:39:09,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 60 transitions, 493 flow [2022-12-13 13:39:09,250 INFO L130 PetriNetUnfolder]: 40/130 cut-off events. [2022-12-13 13:39:09,250 INFO L131 PetriNetUnfolder]: For 203/211 co-relation queries the response was YES. [2022-12-13 13:39:09,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 130 events. 40/130 cut-off events. For 203/211 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 548 event pairs, 0 based on Foata normal form. 3/129 useless extension candidates. Maximal degree in co-relation 368. Up to 48 conditions per place. [2022-12-13 13:39:09,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 60 transitions, 493 flow [2022-12-13 13:39:09,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-13 13:39:09,252 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:09,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 13:39:09,253 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 60 transitions, 493 flow [2022-12-13 13:39:09,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:09,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:09,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:09,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:39:09,253 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-13 13:39:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 34369930, now seen corresponding path program 1 times [2022-12-13 13:39:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:09,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936707595] [2022-12-13 13:39:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:09,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936707595] [2022-12-13 13:39:09,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936707595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:09,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:09,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:39:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615268838] [2022-12-13 13:39:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:09,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:39:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:39:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:39:09,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 13:39:09,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 60 transitions, 493 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:09,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:09,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 13:39:09,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:09,892 INFO L130 PetriNetUnfolder]: 304/531 cut-off events. [2022-12-13 13:39:09,892 INFO L131 PetriNetUnfolder]: For 1170/1170 co-relation queries the response was YES. [2022-12-13 13:39:09,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 531 events. 304/531 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2139 event pairs, 34 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 1889. Up to 314 conditions per place. [2022-12-13 13:39:09,895 INFO L137 encePairwiseOnDemand]: 9/30 looper letters, 44 selfloop transitions, 48 changer transitions 1/93 dead transitions. [2022-12-13 13:39:09,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 93 transitions, 882 flow [2022-12-13 13:39:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:39:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:39:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-13 13:39:09,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-13 13:39:09,896 INFO L175 Difference]: Start difference. First operand has 43 places, 60 transitions, 493 flow. Second operand 6 states and 62 transitions. [2022-12-13 13:39:09,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 93 transitions, 882 flow [2022-12-13 13:39:09,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 863 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:09,901 INFO L231 Difference]: Finished difference. Result has 50 places, 77 transitions, 813 flow [2022-12-13 13:39:09,901 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=813, PETRI_PLACES=50, PETRI_TRANSITIONS=77} [2022-12-13 13:39:09,902 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-13 13:39:09,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:09,902 INFO L89 Accepts]: Start accepts. Operand has 50 places, 77 transitions, 813 flow [2022-12-13 13:39:09,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:09,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:09,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 77 transitions, 813 flow [2022-12-13 13:39:09,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 77 transitions, 813 flow [2022-12-13 13:39:09,918 INFO L130 PetriNetUnfolder]: 52/164 cut-off events. [2022-12-13 13:39:09,918 INFO L131 PetriNetUnfolder]: For 458/479 co-relation queries the response was YES. [2022-12-13 13:39:09,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 164 events. 52/164 cut-off events. For 458/479 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 766 event pairs, 0 based on Foata normal form. 7/163 useless extension candidates. Maximal degree in co-relation 554. Up to 60 conditions per place. [2022-12-13 13:39:09,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 77 transitions, 813 flow [2022-12-13 13:39:09,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 13:39:12,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:12,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2820 [2022-12-13 13:39:12,722 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 77 transitions, 825 flow [2022-12-13 13:39:12,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:12,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:12,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:12,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:39:12,722 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-13 13:39:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2062306086, now seen corresponding path program 1 times [2022-12-13 13:39:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:12,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644328153] [2022-12-13 13:39:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:12,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644328153] [2022-12-13 13:39:12,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644328153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:12,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709857193] [2022-12-13 13:39:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:12,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:12,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:12,783 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-13 13:39:12,785 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-13 13:39:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:12,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:39:12,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:12,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:12,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709857193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:12,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:12,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-13 13:39:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954549357] [2022-12-13 13:39:12,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:12,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:39:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:39:12,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:39:12,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 13:39:12,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 77 transitions, 825 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:12,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:12,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 13:39:12,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:13,093 INFO L130 PetriNetUnfolder]: 391/683 cut-off events. [2022-12-13 13:39:13,093 INFO L131 PetriNetUnfolder]: For 2326/2326 co-relation queries the response was YES. [2022-12-13 13:39:13,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 683 events. 391/683 cut-off events. For 2326/2326 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2959 event pairs, 102 based on Foata normal form. 8/659 useless extension candidates. Maximal degree in co-relation 2207. Up to 324 conditions per place. [2022-12-13 13:39:13,098 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 76 selfloop transitions, 33 changer transitions 1/110 dead transitions. [2022-12-13 13:39:13,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 1258 flow [2022-12-13 13:39:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-13 13:39:13,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-13 13:39:13,099 INFO L175 Difference]: Start difference. First operand has 50 places, 77 transitions, 825 flow. Second operand 5 states and 65 transitions. [2022-12-13 13:39:13,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 1258 flow [2022-12-13 13:39:13,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 1232 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-12-13 13:39:13,106 INFO L231 Difference]: Finished difference. Result has 57 places, 82 transitions, 990 flow [2022-12-13 13:39:13,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=990, PETRI_PLACES=57, PETRI_TRANSITIONS=82} [2022-12-13 13:39:13,107 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2022-12-13 13:39:13,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:13,107 INFO L89 Accepts]: Start accepts. Operand has 57 places, 82 transitions, 990 flow [2022-12-13 13:39:13,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:13,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:13,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 82 transitions, 990 flow [2022-12-13 13:39:13,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 82 transitions, 990 flow [2022-12-13 13:39:13,124 INFO L130 PetriNetUnfolder]: 61/199 cut-off events. [2022-12-13 13:39:13,124 INFO L131 PetriNetUnfolder]: For 837/858 co-relation queries the response was YES. [2022-12-13 13:39:13,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 199 events. 61/199 cut-off events. For 837/858 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1035 event pairs, 1 based on Foata normal form. 9/199 useless extension candidates. Maximal degree in co-relation 760. Up to 74 conditions per place. [2022-12-13 13:39:13,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 82 transitions, 990 flow [2022-12-13 13:39:13,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-13 13:39:13,137 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:13,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 13:39:13,138 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 82 transitions, 990 flow [2022-12-13 13:39:13,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:13,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:13,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:13,156 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-13 13:39:13,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 13:39:13,343 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-13 13:39:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash 853038601, now seen corresponding path program 1 times [2022-12-13 13:39:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:13,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117475777] [2022-12-13 13:39:13,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:13,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117475777] [2022-12-13 13:39:13,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117475777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:13,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:13,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:39:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877312202] [2022-12-13 13:39:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:13,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:39:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:39:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:39:13,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:39:13,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 82 transitions, 990 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:13,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:13,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:39:13,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:14,100 INFO L130 PetriNetUnfolder]: 478/833 cut-off events. [2022-12-13 13:39:14,100 INFO L131 PetriNetUnfolder]: For 4057/4057 co-relation queries the response was YES. [2022-12-13 13:39:14,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 833 events. 478/833 cut-off events. For 4057/4057 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3836 event pairs, 86 based on Foata normal form. 1/794 useless extension candidates. Maximal degree in co-relation 3229. Up to 535 conditions per place. [2022-12-13 13:39:14,106 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 50 selfloop transitions, 64 changer transitions 1/115 dead transitions. [2022-12-13 13:39:14,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 1482 flow [2022-12-13 13:39:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:39:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:39:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-13 13:39:14,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2022-12-13 13:39:14,107 INFO L175 Difference]: Start difference. First operand has 57 places, 82 transitions, 990 flow. Second operand 6 states and 63 transitions. [2022-12-13 13:39:14,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 1482 flow [2022-12-13 13:39:14,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 1446 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:14,116 INFO L231 Difference]: Finished difference. Result has 64 places, 99 transitions, 1403 flow [2022-12-13 13:39:14,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1403, PETRI_PLACES=64, PETRI_TRANSITIONS=99} [2022-12-13 13:39:14,117 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 43 predicate places. [2022-12-13 13:39:14,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:14,117 INFO L89 Accepts]: Start accepts. Operand has 64 places, 99 transitions, 1403 flow [2022-12-13 13:39:14,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:14,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:14,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 99 transitions, 1403 flow [2022-12-13 13:39:14,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 99 transitions, 1403 flow [2022-12-13 13:39:14,144 INFO L130 PetriNetUnfolder]: 74/239 cut-off events. [2022-12-13 13:39:14,144 INFO L131 PetriNetUnfolder]: For 1286/1322 co-relation queries the response was YES. [2022-12-13 13:39:14,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 239 events. 74/239 cut-off events. For 1286/1322 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1312 event pairs, 1 based on Foata normal form. 13/240 useless extension candidates. Maximal degree in co-relation 1062. Up to 88 conditions per place. [2022-12-13 13:39:14,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 99 transitions, 1403 flow [2022-12-13 13:39:14,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 13:39:14,148 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:14,148 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 13:39:14,148 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 99 transitions, 1403 flow [2022-12-13 13:39:14,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:14,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:14,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:14,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:39:14,150 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-13 13:39:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1174894548, now seen corresponding path program 1 times [2022-12-13 13:39:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:14,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360141025] [2022-12-13 13:39:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:14,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360141025] [2022-12-13 13:39:14,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360141025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:14,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:14,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:39:14,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376150763] [2022-12-13 13:39:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:14,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:39:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:14,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:39:14,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:39:14,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:39:14,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 99 transitions, 1403 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:14,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:14,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:39:14,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:14,880 INFO L130 PetriNetUnfolder]: 504/880 cut-off events. [2022-12-13 13:39:14,880 INFO L131 PetriNetUnfolder]: For 5507/5507 co-relation queries the response was YES. [2022-12-13 13:39:14,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 880 events. 504/880 cut-off events. For 5507/5507 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4094 event pairs, 103 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 3698. Up to 616 conditions per place. [2022-12-13 13:39:14,886 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 64 selfloop transitions, 54 changer transitions 1/119 dead transitions. [2022-12-13 13:39:14,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 1752 flow [2022-12-13 13:39:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-13 13:39:14,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2022-12-13 13:39:14,887 INFO L175 Difference]: Start difference. First operand has 64 places, 99 transitions, 1403 flow. Second operand 5 states and 61 transitions. [2022-12-13 13:39:14,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 1752 flow [2022-12-13 13:39:14,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 1738 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 13:39:14,909 INFO L231 Difference]: Finished difference. Result has 70 places, 103 transitions, 1614 flow [2022-12-13 13:39:14,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1614, PETRI_PLACES=70, PETRI_TRANSITIONS=103} [2022-12-13 13:39:14,909 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 13:39:14,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:14,909 INFO L89 Accepts]: Start accepts. Operand has 70 places, 103 transitions, 1614 flow [2022-12-13 13:39:14,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:14,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:14,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 103 transitions, 1614 flow [2022-12-13 13:39:14,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 103 transitions, 1614 flow [2022-12-13 13:39:14,932 INFO L130 PetriNetUnfolder]: 76/250 cut-off events. [2022-12-13 13:39:14,933 INFO L131 PetriNetUnfolder]: For 1795/1829 co-relation queries the response was YES. [2022-12-13 13:39:14,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 250 events. 76/250 cut-off events. For 1795/1829 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1404 event pairs, 1 based on Foata normal form. 14/251 useless extension candidates. Maximal degree in co-relation 1188. Up to 92 conditions per place. [2022-12-13 13:39:14,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 103 transitions, 1614 flow [2022-12-13 13:39:14,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 13:39:14,936 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:14,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 13:39:14,937 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 103 transitions, 1614 flow [2022-12-13 13:39:14,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:14,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:14,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:14,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:39:14,937 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-13 13:39:14,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash -438977307, now seen corresponding path program 1 times [2022-12-13 13:39:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:14,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403075941] [2022-12-13 13:39:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:15,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403075941] [2022-12-13 13:39:15,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403075941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:15,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:15,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:39:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919070010] [2022-12-13 13:39:15,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:15,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:39:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:15,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:39:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:39:15,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 13:39:15,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 103 transitions, 1614 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:15,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:15,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 13:39:15,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:15,202 INFO L130 PetriNetUnfolder]: 522/980 cut-off events. [2022-12-13 13:39:15,203 INFO L131 PetriNetUnfolder]: For 7884/7884 co-relation queries the response was YES. [2022-12-13 13:39:15,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 980 events. 522/980 cut-off events. For 7884/7884 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5170 event pairs, 68 based on Foata normal form. 36/976 useless extension candidates. Maximal degree in co-relation 4147. Up to 427 conditions per place. [2022-12-13 13:39:15,209 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 97 selfloop transitions, 39 changer transitions 12/148 dead transitions. [2022-12-13 13:39:15,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 148 transitions, 2380 flow [2022-12-13 13:39:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-13 13:39:15,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2022-12-13 13:39:15,210 INFO L175 Difference]: Start difference. First operand has 70 places, 103 transitions, 1614 flow. Second operand 5 states and 58 transitions. [2022-12-13 13:39:15,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 148 transitions, 2380 flow [2022-12-13 13:39:15,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 148 transitions, 2353 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 13:39:15,225 INFO L231 Difference]: Finished difference. Result has 76 places, 105 transitions, 1764 flow [2022-12-13 13:39:15,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1764, PETRI_PLACES=76, PETRI_TRANSITIONS=105} [2022-12-13 13:39:15,226 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2022-12-13 13:39:15,226 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:15,226 INFO L89 Accepts]: Start accepts. Operand has 76 places, 105 transitions, 1764 flow [2022-12-13 13:39:15,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:15,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:15,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 105 transitions, 1764 flow [2022-12-13 13:39:15,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 105 transitions, 1764 flow [2022-12-13 13:39:15,253 INFO L130 PetriNetUnfolder]: 76/277 cut-off events. [2022-12-13 13:39:15,253 INFO L131 PetriNetUnfolder]: For 2300/2327 co-relation queries the response was YES. [2022-12-13 13:39:15,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 277 events. 76/277 cut-off events. For 2300/2327 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1662 event pairs, 1 based on Foata normal form. 14/279 useless extension candidates. Maximal degree in co-relation 1391. Up to 93 conditions per place. [2022-12-13 13:39:15,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 105 transitions, 1764 flow [2022-12-13 13:39:15,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-13 13:39:15,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:15,477 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:15,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-13 13:39:15,478 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 105 transitions, 1779 flow [2022-12-13 13:39:15,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:15,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:15,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:15,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:39:15,483 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-13 13:39:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash 919242395, now seen corresponding path program 2 times [2022-12-13 13:39:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:15,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486094514] [2022-12-13 13:39:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:15,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:15,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486094514] [2022-12-13 13:39:15,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486094514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:15,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695444927] [2022-12-13 13:39:15,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:39:15,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:15,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:15,560 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-13 13:39:15,596 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-13 13:39:15,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:39:15,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:39:15,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:39:15,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:15,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:15,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695444927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:15,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:15,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 13:39:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015541703] [2022-12-13 13:39:15,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:39:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:39:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:39:15,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 13:39:15,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 105 transitions, 1779 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:15,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:15,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 13:39:15,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:16,099 INFO L130 PetriNetUnfolder]: 548/1003 cut-off events. [2022-12-13 13:39:16,099 INFO L131 PetriNetUnfolder]: For 9704/9704 co-relation queries the response was YES. [2022-12-13 13:39:16,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 1003 events. 548/1003 cut-off events. For 9704/9704 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5073 event pairs, 118 based on Foata normal form. 31/994 useless extension candidates. Maximal degree in co-relation 5051. Up to 361 conditions per place. [2022-12-13 13:39:16,107 INFO L137 encePairwiseOnDemand]: 14/32 looper letters, 81 selfloop transitions, 83 changer transitions 0/164 dead transitions. [2022-12-13 13:39:16,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 164 transitions, 2594 flow [2022-12-13 13:39:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:39:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:39:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2022-12-13 13:39:16,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.296875 [2022-12-13 13:39:16,108 INFO L175 Difference]: Start difference. First operand has 76 places, 105 transitions, 1779 flow. Second operand 10 states and 95 transitions. [2022-12-13 13:39:16,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 164 transitions, 2594 flow [2022-12-13 13:39:16,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 164 transitions, 2350 flow, removed 81 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:16,130 INFO L231 Difference]: Finished difference. Result has 91 places, 125 transitions, 2140 flow [2022-12-13 13:39:16,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2140, PETRI_PLACES=91, PETRI_TRANSITIONS=125} [2022-12-13 13:39:16,131 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-13 13:39:16,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:16,131 INFO L89 Accepts]: Start accepts. Operand has 91 places, 125 transitions, 2140 flow [2022-12-13 13:39:16,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:16,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:16,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 125 transitions, 2140 flow [2022-12-13 13:39:16,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 125 transitions, 2140 flow [2022-12-13 13:39:16,167 INFO L130 PetriNetUnfolder]: 119/367 cut-off events. [2022-12-13 13:39:16,167 INFO L131 PetriNetUnfolder]: For 4324/4392 co-relation queries the response was YES. [2022-12-13 13:39:16,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 367 events. 119/367 cut-off events. For 4324/4392 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2237 event pairs, 8 based on Foata normal form. 42/396 useless extension candidates. Maximal degree in co-relation 2110. Up to 142 conditions per place. [2022-12-13 13:39:16,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 125 transitions, 2140 flow [2022-12-13 13:39:16,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 13:39:16,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:16,470 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:39:16,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-13 13:39:16,471 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 124 transitions, 2140 flow [2022-12-13 13:39:16,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:16,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:16,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:16,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:39:16,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:16,672 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-13 13:39:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -137610093, now seen corresponding path program 3 times [2022-12-13 13:39:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:16,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390685809] [2022-12-13 13:39:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:16,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390685809] [2022-12-13 13:39:16,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390685809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:16,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:16,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:39:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764243454] [2022-12-13 13:39:16,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:16,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:39:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:16,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:39:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:39:16,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 13:39:16,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 124 transitions, 2140 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:16,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:16,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 13:39:16,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:16,961 INFO L130 PetriNetUnfolder]: 470/921 cut-off events. [2022-12-13 13:39:16,961 INFO L131 PetriNetUnfolder]: For 12869/12869 co-relation queries the response was YES. [2022-12-13 13:39:16,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6142 conditions, 921 events. 470/921 cut-off events. For 12869/12869 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4901 event pairs, 134 based on Foata normal form. 76/989 useless extension candidates. Maximal degree in co-relation 5288. Up to 458 conditions per place. [2022-12-13 13:39:16,967 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 81 selfloop transitions, 63 changer transitions 0/144 dead transitions. [2022-12-13 13:39:16,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 144 transitions, 2554 flow [2022-12-13 13:39:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 13:39:16,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2022-12-13 13:39:16,968 INFO L175 Difference]: Start difference. First operand has 90 places, 124 transitions, 2140 flow. Second operand 5 states and 66 transitions. [2022-12-13 13:39:16,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 144 transitions, 2554 flow [2022-12-13 13:39:16,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 144 transitions, 2464 flow, removed 45 selfloop flow, removed 1 redundant places. [2022-12-13 13:39:16,992 INFO L231 Difference]: Finished difference. Result has 94 places, 126 transitions, 2242 flow [2022-12-13 13:39:16,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2242, PETRI_PLACES=94, PETRI_TRANSITIONS=126} [2022-12-13 13:39:16,992 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-13 13:39:16,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:16,992 INFO L89 Accepts]: Start accepts. Operand has 94 places, 126 transitions, 2242 flow [2022-12-13 13:39:16,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:16,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:16,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 126 transitions, 2242 flow [2022-12-13 13:39:16,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 126 transitions, 2242 flow [2022-12-13 13:39:17,025 INFO L130 PetriNetUnfolder]: 116/381 cut-off events. [2022-12-13 13:39:17,025 INFO L131 PetriNetUnfolder]: For 4555/4600 co-relation queries the response was YES. [2022-12-13 13:39:17,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 381 events. 116/381 cut-off events. For 4555/4600 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2435 event pairs, 10 based on Foata normal form. 22/391 useless extension candidates. Maximal degree in co-relation 2173. Up to 124 conditions per place. [2022-12-13 13:39:17,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 126 transitions, 2242 flow [2022-12-13 13:39:17,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 13:39:17,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:17,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:17,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:17,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:17,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:17,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:17,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:18,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:18,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:18,383 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:18,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:18,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:18,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:18,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:19,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:19,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:19,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:19,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:19,601 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:39:19,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2609 [2022-12-13 13:39:19,601 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 128 transitions, 2377 flow [2022-12-13 13:39:19,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:19,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:19,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:19,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:39:19,602 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:19,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1990663069, now seen corresponding path program 1 times [2022-12-13 13:39:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:19,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45896748] [2022-12-13 13:39:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:20,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45896748] [2022-12-13 13:39:20,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45896748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:20,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:20,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:39:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953014500] [2022-12-13 13:39:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:20,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:39:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:20,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:39:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:39:20,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 13:39:20,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 128 transitions, 2377 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:20,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:20,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 13:39:20,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:20,455 INFO L130 PetriNetUnfolder]: 533/1093 cut-off events. [2022-12-13 13:39:20,455 INFO L131 PetriNetUnfolder]: For 12958/12958 co-relation queries the response was YES. [2022-12-13 13:39:20,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7514 conditions, 1093 events. 533/1093 cut-off events. For 12958/12958 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6457 event pairs, 203 based on Foata normal form. 1/1078 useless extension candidates. Maximal degree in co-relation 6511. Up to 954 conditions per place. [2022-12-13 13:39:20,463 INFO L137 encePairwiseOnDemand]: 27/52 looper letters, 109 selfloop transitions, 45 changer transitions 3/157 dead transitions. [2022-12-13 13:39:20,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 157 transitions, 3055 flow [2022-12-13 13:39:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:39:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:39:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 13:39:20,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25961538461538464 [2022-12-13 13:39:20,464 INFO L175 Difference]: Start difference. First operand has 96 places, 128 transitions, 2377 flow. Second operand 6 states and 81 transitions. [2022-12-13 13:39:20,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 157 transitions, 3055 flow [2022-12-13 13:39:20,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 157 transitions, 2819 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-13 13:39:20,490 INFO L231 Difference]: Finished difference. Result has 100 places, 140 transitions, 2544 flow [2022-12-13 13:39:20,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2544, PETRI_PLACES=100, PETRI_TRANSITIONS=140} [2022-12-13 13:39:20,490 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-13 13:39:20,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:20,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 140 transitions, 2544 flow [2022-12-13 13:39:20,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:20,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:20,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 140 transitions, 2544 flow [2022-12-13 13:39:20,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 140 transitions, 2544 flow [2022-12-13 13:39:20,530 INFO L130 PetriNetUnfolder]: 121/459 cut-off events. [2022-12-13 13:39:20,530 INFO L131 PetriNetUnfolder]: For 4975/5022 co-relation queries the response was YES. [2022-12-13 13:39:20,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 459 events. 121/459 cut-off events. For 4975/5022 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3305 event pairs, 13 based on Foata normal form. 25/465 useless extension candidates. Maximal degree in co-relation 2717. Up to 139 conditions per place. [2022-12-13 13:39:20,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 140 transitions, 2544 flow [2022-12-13 13:39:20,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 13:39:22,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:22,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1682 [2022-12-13 13:39:22,172 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 140 transitions, 2556 flow [2022-12-13 13:39:22,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:22,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:22,172 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:22,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:39:22,172 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1213637383, now seen corresponding path program 1 times [2022-12-13 13:39:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:22,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308241605] [2022-12-13 13:39:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:22,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:22,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308241605] [2022-12-13 13:39:22,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308241605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:22,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:22,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:39:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633692843] [2022-12-13 13:39:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:22,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:39:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:39:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:39:22,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 13:39:22,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 140 transitions, 2556 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:22,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:22,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 13:39:22,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:22,502 INFO L130 PetriNetUnfolder]: 536/1098 cut-off events. [2022-12-13 13:39:22,502 INFO L131 PetriNetUnfolder]: For 12711/12711 co-relation queries the response was YES. [2022-12-13 13:39:22,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 1098 events. 536/1098 cut-off events. For 12711/12711 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6500 event pairs, 256 based on Foata normal form. 2/1070 useless extension candidates. Maximal degree in co-relation 7327. Up to 1038 conditions per place. [2022-12-13 13:39:22,515 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 130 selfloop transitions, 15 changer transitions 7/152 dead transitions. [2022-12-13 13:39:22,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 152 transitions, 2962 flow [2022-12-13 13:39:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:39:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:39:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 13:39:22,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2022-12-13 13:39:22,516 INFO L175 Difference]: Start difference. First operand has 100 places, 140 transitions, 2556 flow. Second operand 4 states and 68 transitions. [2022-12-13 13:39:22,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 152 transitions, 2962 flow [2022-12-13 13:39:22,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 152 transitions, 2878 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 13:39:22,546 INFO L231 Difference]: Finished difference. Result has 100 places, 143 transitions, 2582 flow [2022-12-13 13:39:22,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2472, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2582, PETRI_PLACES=100, PETRI_TRANSITIONS=143} [2022-12-13 13:39:22,546 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-13 13:39:22,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:22,546 INFO L89 Accepts]: Start accepts. Operand has 100 places, 143 transitions, 2582 flow [2022-12-13 13:39:22,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:22,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:22,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 143 transitions, 2582 flow [2022-12-13 13:39:22,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 143 transitions, 2582 flow [2022-12-13 13:39:22,588 INFO L130 PetriNetUnfolder]: 122/459 cut-off events. [2022-12-13 13:39:22,588 INFO L131 PetriNetUnfolder]: For 5120/5169 co-relation queries the response was YES. [2022-12-13 13:39:22,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 459 events. 122/459 cut-off events. For 5120/5169 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3312 event pairs, 14 based on Foata normal form. 27/465 useless extension candidates. Maximal degree in co-relation 2469. Up to 139 conditions per place. [2022-12-13 13:39:22,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 143 transitions, 2582 flow [2022-12-13 13:39:22,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-13 13:39:22,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:23,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:23,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 559 [2022-12-13 13:39:23,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 142 transitions, 2593 flow [2022-12-13 13:39:23,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:23,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:23,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:23,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:39:23,105 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash -4697782, now seen corresponding path program 1 times [2022-12-13 13:39:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:23,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682309802] [2022-12-13 13:39:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:23,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:23,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682309802] [2022-12-13 13:39:23,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682309802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:23,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575568112] [2022-12-13 13:39:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:23,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:23,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:23,205 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-13 13:39:23,206 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-13 13:39:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:23,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:39:23,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:23,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:23,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575568112] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:23,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:23,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-12-13 13:39:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946088854] [2022-12-13 13:39:23,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:23,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:39:23,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:23,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:39:23,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:39:23,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 13:39:23,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 142 transitions, 2593 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:23,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:23,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 13:39:23,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:23,758 INFO L130 PetriNetUnfolder]: 571/1189 cut-off events. [2022-12-13 13:39:23,758 INFO L131 PetriNetUnfolder]: For 14258/14258 co-relation queries the response was YES. [2022-12-13 13:39:23,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8033 conditions, 1189 events. 571/1189 cut-off events. For 14258/14258 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7244 event pairs, 252 based on Foata normal form. 34/1193 useless extension candidates. Maximal degree in co-relation 6984. Up to 1025 conditions per place. [2022-12-13 13:39:23,768 INFO L137 encePairwiseOnDemand]: 39/54 looper letters, 144 selfloop transitions, 21 changer transitions 9/174 dead transitions. [2022-12-13 13:39:23,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 174 transitions, 3197 flow [2022-12-13 13:39:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:39:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:39:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-13 13:39:23,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2839506172839506 [2022-12-13 13:39:23,769 INFO L175 Difference]: Start difference. First operand has 99 places, 142 transitions, 2593 flow. Second operand 6 states and 92 transitions. [2022-12-13 13:39:23,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 174 transitions, 3197 flow [2022-12-13 13:39:23,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 174 transitions, 3149 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:23,802 INFO L231 Difference]: Finished difference. Result has 104 places, 145 transitions, 2648 flow [2022-12-13 13:39:23,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2551, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2648, PETRI_PLACES=104, PETRI_TRANSITIONS=145} [2022-12-13 13:39:23,803 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 83 predicate places. [2022-12-13 13:39:23,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:23,803 INFO L89 Accepts]: Start accepts. Operand has 104 places, 145 transitions, 2648 flow [2022-12-13 13:39:23,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:23,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:23,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 145 transitions, 2648 flow [2022-12-13 13:39:23,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 145 transitions, 2648 flow [2022-12-13 13:39:23,847 INFO L130 PetriNetUnfolder]: 128/500 cut-off events. [2022-12-13 13:39:23,847 INFO L131 PetriNetUnfolder]: For 5895/5946 co-relation queries the response was YES. [2022-12-13 13:39:23,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 500 events. 128/500 cut-off events. For 5895/5946 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3737 event pairs, 14 based on Foata normal form. 27/505 useless extension candidates. Maximal degree in co-relation 2699. Up to 151 conditions per place. [2022-12-13 13:39:23,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 145 transitions, 2648 flow [2022-12-13 13:39:23,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 13:39:24,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:24,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 425 [2022-12-13 13:39:24,228 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 145 transitions, 2663 flow [2022-12-13 13:39:24,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:24,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:24,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:24,233 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-13 13:39:24,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:24,435 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1538220514, now seen corresponding path program 1 times [2022-12-13 13:39:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:24,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900752414] [2022-12-13 13:39:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:24,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:24,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900752414] [2022-12-13 13:39:24,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900752414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:24,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903697137] [2022-12-13 13:39:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:24,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:24,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:24,794 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-13 13:39:24,796 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-13 13:39:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:24,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:39:24,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:24,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:39:24,893 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 14 treesize of output 16 [2022-12-13 13:39:24,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:24,936 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 13:39:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:24,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:24,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:24,995 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 13:39:25,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:25,010 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-13 13:39:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:25,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903697137] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:25,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:25,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:39:25,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184403144] [2022-12-13 13:39:25,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:25,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:39:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:39:25,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:39:25,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 13:39:25,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 145 transitions, 2663 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:25,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:25,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 13:39:25,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:25,865 INFO L130 PetriNetUnfolder]: 791/1600 cut-off events. [2022-12-13 13:39:25,865 INFO L131 PetriNetUnfolder]: For 22846/22846 co-relation queries the response was YES. [2022-12-13 13:39:25,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 1600 events. 791/1600 cut-off events. For 22846/22846 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9976 event pairs, 152 based on Foata normal form. 3/1575 useless extension candidates. Maximal degree in co-relation 9941. Up to 707 conditions per place. [2022-12-13 13:39:25,874 INFO L137 encePairwiseOnDemand]: 18/55 looper letters, 101 selfloop transitions, 110 changer transitions 14/225 dead transitions. [2022-12-13 13:39:25,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 225 transitions, 3881 flow [2022-12-13 13:39:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:39:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:39:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2022-12-13 13:39:25,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2231404958677686 [2022-12-13 13:39:25,876 INFO L175 Difference]: Start difference. First operand has 104 places, 145 transitions, 2663 flow. Second operand 11 states and 135 transitions. [2022-12-13 13:39:25,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 225 transitions, 3881 flow [2022-12-13 13:39:25,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 225 transitions, 3755 flow, removed 55 selfloop flow, removed 1 redundant places. [2022-12-13 13:39:25,923 INFO L231 Difference]: Finished difference. Result has 117 places, 170 transitions, 3295 flow [2022-12-13 13:39:25,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3295, PETRI_PLACES=117, PETRI_TRANSITIONS=170} [2022-12-13 13:39:25,924 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2022-12-13 13:39:25,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:25,924 INFO L89 Accepts]: Start accepts. Operand has 117 places, 170 transitions, 3295 flow [2022-12-13 13:39:25,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:25,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:25,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 170 transitions, 3295 flow [2022-12-13 13:39:25,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 170 transitions, 3295 flow [2022-12-13 13:39:25,982 INFO L130 PetriNetUnfolder]: 174/653 cut-off events. [2022-12-13 13:39:25,983 INFO L131 PetriNetUnfolder]: For 8848/8930 co-relation queries the response was YES. [2022-12-13 13:39:25,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 653 events. 174/653 cut-off events. For 8848/8930 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5086 event pairs, 27 based on Foata normal form. 31/656 useless extension candidates. Maximal degree in co-relation 3844. Up to 207 conditions per place. [2022-12-13 13:39:25,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 170 transitions, 3295 flow [2022-12-13 13:39:25,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 13:39:25,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_106| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (= (ite (and (<= 0 v_~x1~0_119) (< v_~x1~0_119 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_52| |v_#pthreadsForks_64|) (= (store |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_52|)) |v_#memory_int_159|) (= v_~x1~0_118 (select (select |v_#memory_int_160| v_~f~0.base_94) (+ v_~f~0.offset_94 (* v_~x1~0_119 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_106| 4294967295) 4294967296) (* 2 (mod v_~n~0_105 2147483648))) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|)) InVars {#pthreadsForks=|v_#pthreadsForks_64|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, #memory_int=|v_#memory_int_160|, ~n~0=v_~n~0_105, ~x1~0=v_~x1~0_119, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ~f~0.offset=v_~f~0.offset_94} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, ~x1~0=v_~x1~0_118, ~f~0.offset=v_~f~0.offset_94, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_52|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_41|, #pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_55|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_159|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, ~n~0=v_~n~0_105, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:26,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:26,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-13 13:39:26,111 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 170 transitions, 3313 flow [2022-12-13 13:39:26,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:26,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:26,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:26,119 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-13 13:39:26,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:26,316 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:26,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1099146626, now seen corresponding path program 1 times [2022-12-13 13:39:26,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:26,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9812238] [2022-12-13 13:39:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:26,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:26,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9812238] [2022-12-13 13:39:26,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9812238] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:26,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499777050] [2022-12-13 13:39:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:26,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:26,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:26,489 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-13 13:39:26,490 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-13 13:39:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:26,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 13:39:26,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:26,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:39:26,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 13:39:26,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:39:26,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:39:26,747 INFO L321 Elim1Store]: treesize reduction 87, result has 28.1 percent of original size [2022-12-13 13:39:26,748 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 11 new quantified variables, introduced 15 case distinctions, treesize of input 253 treesize of output 95 [2022-12-13 13:39:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:26,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:27,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499777050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:27,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:27,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-13 13:39:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037499943] [2022-12-13 13:39:27,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:27,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:39:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:39:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=115, Unknown=2, NotChecked=0, Total=156 [2022-12-13 13:39:27,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 13:39:27,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 170 transitions, 3313 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:27,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:27,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 13:39:27,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:35,537 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:39:37,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:39:39,073 INFO L130 PetriNetUnfolder]: 892/1794 cut-off events. [2022-12-13 13:39:39,073 INFO L131 PetriNetUnfolder]: For 27088/27088 co-relation queries the response was YES. [2022-12-13 13:39:39,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13181 conditions, 1794 events. 892/1794 cut-off events. For 27088/27088 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11562 event pairs, 254 based on Foata normal form. 8/1780 useless extension candidates. Maximal degree in co-relation 11704. Up to 1406 conditions per place. [2022-12-13 13:39:39,085 INFO L137 encePairwiseOnDemand]: 24/56 looper letters, 144 selfloop transitions, 66 changer transitions 30/240 dead transitions. [2022-12-13 13:39:39,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 240 transitions, 4452 flow [2022-12-13 13:39:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:39:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:39:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2022-12-13 13:39:39,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19345238095238096 [2022-12-13 13:39:39,086 INFO L175 Difference]: Start difference. First operand has 117 places, 170 transitions, 3313 flow. Second operand 12 states and 130 transitions. [2022-12-13 13:39:39,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 240 transitions, 4452 flow [2022-12-13 13:39:39,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 240 transitions, 4372 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:39,144 INFO L231 Difference]: Finished difference. Result has 131 places, 183 transitions, 3674 flow [2022-12-13 13:39:39,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3235, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3674, PETRI_PLACES=131, PETRI_TRANSITIONS=183} [2022-12-13 13:39:39,145 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 110 predicate places. [2022-12-13 13:39:39,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:39,145 INFO L89 Accepts]: Start accepts. Operand has 131 places, 183 transitions, 3674 flow [2022-12-13 13:39:39,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:39,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:39,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 183 transitions, 3674 flow [2022-12-13 13:39:39,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 183 transitions, 3674 flow [2022-12-13 13:39:39,211 INFO L130 PetriNetUnfolder]: 190/719 cut-off events. [2022-12-13 13:39:39,211 INFO L131 PetriNetUnfolder]: For 10487/10579 co-relation queries the response was YES. [2022-12-13 13:39:39,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 719 events. 190/719 cut-off events. For 10487/10579 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5812 event pairs, 29 based on Foata normal form. 27/720 useless extension candidates. Maximal degree in co-relation 4715. Up to 219 conditions per place. [2022-12-13 13:39:39,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 183 transitions, 3674 flow [2022-12-13 13:39:39,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 13:39:39,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_279| v_~f~0.base_186))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_186 (* v_~x2~0_233 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_186 (* .cse5 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_186 (* .cse4 4)))) (.cse2 (* (mod v_~n~0_189 2147483648) 2)) (.cse3 (select .cse0 (+ v_~f~0.offset_186 (* v_~x1~0_290 4))))) (and (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_186)) v_~x2~0_231) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_243| 4294967295) 4294967296) .cse2) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_191|) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_190)) 1 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_244| 4294967296) .cse2) (not (= (ite (and (< v_~x1~0_290 v_~size~0_190) (<= 0 v_~x1~0_290)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|) (= |v_thread1Thread1of1ForFork0_~i~0#1_243| (+ |v_thread1Thread1of1ForFork0_~i~0#1_244| 2)) (= (ite (and (< .cse3 v_~size~0_190) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_193| 4) |v_thread2Thread1of1ForFork1_~i~1#1_191|) (not (= (ite (and (< v_~x2~0_233 v_~size~0_190) (<= 0 v_~x2~0_233)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_193| 4294967296) .cse2) (not (= (ite (and (< .cse4 v_~size~0_190) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (= (select .cse0 (+ v_~f~0.offset_186 (* .cse3 4))) v_~x1~0_289) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_190)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_244|, #memory_int=|v_#memory_int_279|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_193|, ~n~0=v_~n~0_189, ~x1~0=v_~x1~0_290, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_231, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_153|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_102|, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_106|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~x1~0=v_~x1~0_289, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_243|, #memory_int=|v_#memory_int_279|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_92|, ~n~0=v_~n~0_189, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_92|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_161|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:40,738 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:40,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1593 [2022-12-13 13:39:40,738 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 183 transitions, 3712 flow [2022-12-13 13:39:40,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:40,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:40,739 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:40,745 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-13 13:39:40,939 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,SelfDestructingSolverStorable24 [2022-12-13 13:39:40,939 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1649824770, now seen corresponding path program 1 times [2022-12-13 13:39:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:40,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664505604] [2022-12-13 13:39:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:40,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664505604] [2022-12-13 13:39:40,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664505604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:40,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414595195] [2022-12-13 13:39:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:40,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:40,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:40,998 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-13 13:39:41,000 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-13 13:39:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:41,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:39:41,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:41,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414595195] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:41,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 13:39:41,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334152222] [2022-12-13 13:39:41,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:41,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:39:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:39:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:39:41,122 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 13:39:41,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 183 transitions, 3712 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:41,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:41,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 13:39:41,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:41,712 INFO L130 PetriNetUnfolder]: 1002/1993 cut-off events. [2022-12-13 13:39:41,712 INFO L131 PetriNetUnfolder]: For 32359/32359 co-relation queries the response was YES. [2022-12-13 13:39:41,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15372 conditions, 1993 events. 1002/1993 cut-off events. For 32359/32359 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13051 event pairs, 268 based on Foata normal form. 6/1989 useless extension candidates. Maximal degree in co-relation 14994. Up to 1024 conditions per place. [2022-12-13 13:39:41,726 INFO L137 encePairwiseOnDemand]: 19/58 looper letters, 143 selfloop transitions, 88 changer transitions 1/232 dead transitions. [2022-12-13 13:39:41,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 232 transitions, 4867 flow [2022-12-13 13:39:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:39:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:39:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 13:39:41,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28448275862068967 [2022-12-13 13:39:41,727 INFO L175 Difference]: Start difference. First operand has 130 places, 183 transitions, 3712 flow. Second operand 6 states and 99 transitions. [2022-12-13 13:39:41,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 232 transitions, 4867 flow [2022-12-13 13:39:41,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 232 transitions, 4727 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-13 13:39:41,859 INFO L231 Difference]: Finished difference. Result has 133 places, 187 transitions, 3989 flow [2022-12-13 13:39:41,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3989, PETRI_PLACES=133, PETRI_TRANSITIONS=187} [2022-12-13 13:39:41,860 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-13 13:39:41,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:41,861 INFO L89 Accepts]: Start accepts. Operand has 133 places, 187 transitions, 3989 flow [2022-12-13 13:39:41,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:41,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:41,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 187 transitions, 3989 flow [2022-12-13 13:39:41,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 187 transitions, 3989 flow [2022-12-13 13:39:41,938 INFO L130 PetriNetUnfolder]: 210/780 cut-off events. [2022-12-13 13:39:41,938 INFO L131 PetriNetUnfolder]: For 12603/12730 co-relation queries the response was YES. [2022-12-13 13:39:41,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5540 conditions, 780 events. 210/780 cut-off events. For 12603/12730 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6410 event pairs, 39 based on Foata normal form. 37/783 useless extension candidates. Maximal degree in co-relation 5370. Up to 235 conditions per place. [2022-12-13 13:39:41,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 187 transitions, 3989 flow [2022-12-13 13:39:41,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 13:39:41,946 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:41,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 13:39:41,947 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 187 transitions, 3989 flow [2022-12-13 13:39:41,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:41,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:41,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:41,957 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-13 13:39:42,151 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,SelfDestructingSolverStorable25 [2022-12-13 13:39:42,152 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1563364417, now seen corresponding path program 1 times [2022-12-13 13:39:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:42,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394635679] [2022-12-13 13:39:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:42,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394635679] [2022-12-13 13:39:42,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394635679] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:42,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164457982] [2022-12-13 13:39:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:42,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:42,257 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-13 13:39:42,270 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-13 13:39:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:42,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:39:42,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:42,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:42,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164457982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:42,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:42,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 13:39:42,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298276061] [2022-12-13 13:39:42,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:42,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:39:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:42,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:39:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:39:42,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 13:39:42,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 187 transitions, 3989 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:42,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:42,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 13:39:42,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:43,525 INFO L130 PetriNetUnfolder]: 1116/2195 cut-off events. [2022-12-13 13:39:43,525 INFO L131 PetriNetUnfolder]: For 40329/40329 co-relation queries the response was YES. [2022-12-13 13:39:43,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17683 conditions, 2195 events. 1116/2195 cut-off events. For 40329/40329 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14461 event pairs, 285 based on Foata normal form. 49/2234 useless extension candidates. Maximal degree in co-relation 17295. Up to 899 conditions per place. [2022-12-13 13:39:43,540 INFO L137 encePairwiseOnDemand]: 17/57 looper letters, 135 selfloop transitions, 133 changer transitions 0/268 dead transitions. [2022-12-13 13:39:43,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 268 transitions, 5685 flow [2022-12-13 13:39:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:39:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:39:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 141 transitions. [2022-12-13 13:39:43,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1902834008097166 [2022-12-13 13:39:43,542 INFO L175 Difference]: Start difference. First operand has 132 places, 187 transitions, 3989 flow. Second operand 13 states and 141 transitions. [2022-12-13 13:39:43,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 268 transitions, 5685 flow [2022-12-13 13:39:43,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 268 transitions, 5589 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:43,631 INFO L231 Difference]: Finished difference. Result has 152 places, 208 transitions, 4874 flow [2022-12-13 13:39:43,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3939, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4874, PETRI_PLACES=152, PETRI_TRANSITIONS=208} [2022-12-13 13:39:43,631 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-13 13:39:43,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:43,631 INFO L89 Accepts]: Start accepts. Operand has 152 places, 208 transitions, 4874 flow [2022-12-13 13:39:43,632 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:43,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:43,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 208 transitions, 4874 flow [2022-12-13 13:39:43,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 208 transitions, 4874 flow [2022-12-13 13:39:43,719 INFO L130 PetriNetUnfolder]: 232/841 cut-off events. [2022-12-13 13:39:43,719 INFO L131 PetriNetUnfolder]: For 21358/21525 co-relation queries the response was YES. [2022-12-13 13:39:43,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7121 conditions, 841 events. 232/841 cut-off events. For 21358/21525 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6988 event pairs, 42 based on Foata normal form. 45/852 useless extension candidates. Maximal degree in co-relation 6934. Up to 276 conditions per place. [2022-12-13 13:39:43,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 208 transitions, 4874 flow [2022-12-13 13:39:43,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-13 13:39:45,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_292| v_~f~0.base_192))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_192 (* v_~x2~0_249 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_192 (* .cse7 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_192 (* .cse6 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_192 (* 4 .cse3))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_192 (* v_~x1~0_314 4)))) (.cse0 (* 2 (mod v_~n~0_195 2147483648))) (.cse5 (select .cse4 (+ v_~f~0.offset_192 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_263| 4294967295) 4294967296) .cse0) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_196)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_151|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_264| 4294967296) .cse0) (not (= (ite (and (< .cse2 v_~size~0_196) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_196) (<= 0 .cse3)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_206|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_249 v_~size~0_196) (<= 0 v_~x2~0_249)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_314 v_~size~0_196) (<= 0 v_~x1~0_314)) 1 0) 0)) (= v_~x2~0_247 (select .cse4 (+ v_~f~0.offset_192 (* .cse5 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_206| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_208|)) (= v_~x1~0_313 (select .cse4 (+ v_~f~0.offset_192 (* .cse1 4)))) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_206|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_196)) 1 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_196)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_263| (+ |v_thread1Thread1of1ForFork0_~i~0#1_264| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_151| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|)))))))) InVars {~x2~0=v_~x2~0_249, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_192, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_264|, #memory_int=|v_#memory_int_292|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_195, ~x1~0=v_~x1~0_314, ~f~0.offset=v_~f~0.offset_192} OutVars{~x2~0=v_~x2~0_247, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_169|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_192, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_206|, ~x1~0=v_~x1~0_313, ~f~0.offset=v_~f~0.offset_192, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_151|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_263|, #memory_int=|v_#memory_int_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_103|, ~n~0=v_~n~0_195, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_103|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_177|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:46,355 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:46,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2724 [2022-12-13 13:39:46,355 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 208 transitions, 4928 flow [2022-12-13 13:39:46,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:46,355 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:46,355 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:46,360 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-13 13:39:46,561 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,SelfDestructingSolverStorable26 [2022-12-13 13:39:46,561 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash 542435676, now seen corresponding path program 2 times [2022-12-13 13:39:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:46,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532224060] [2022-12-13 13:39:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:46,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532224060] [2022-12-13 13:39:46,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532224060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:46,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627207578] [2022-12-13 13:39:46,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:39:46,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:46,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:46,929 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-13 13:39:46,930 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-13 13:39:47,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:39:47,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:39:47,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:39:47,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:47,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:39:47,048 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 14 treesize of output 16 [2022-12-13 13:39:47,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:47,081 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 13:39:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:47,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:47,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:47,142 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-13 13:39:47,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:39:47,157 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-13 13:39:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:47,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627207578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:47,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:47,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:39:47,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213943479] [2022-12-13 13:39:47,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:47,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:39:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:39:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:39:47,272 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 13:39:47,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 208 transitions, 4928 flow. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:47,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:47,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 13:39:47,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:48,214 INFO L130 PetriNetUnfolder]: 1316/2559 cut-off events. [2022-12-13 13:39:48,214 INFO L131 PetriNetUnfolder]: For 68644/68644 co-relation queries the response was YES. [2022-12-13 13:39:48,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23632 conditions, 2559 events. 1316/2559 cut-off events. For 68644/68644 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 17195 event pairs, 540 based on Foata normal form. 4/2553 useless extension candidates. Maximal degree in co-relation 23217. Up to 2042 conditions per place. [2022-12-13 13:39:48,234 INFO L137 encePairwiseOnDemand]: 25/59 looper letters, 182 selfloop transitions, 78 changer transitions 12/272 dead transitions. [2022-12-13 13:39:48,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 272 transitions, 6316 flow [2022-12-13 13:39:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:39:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:39:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-12-13 13:39:48,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.211864406779661 [2022-12-13 13:39:48,235 INFO L175 Difference]: Start difference. First operand has 152 places, 208 transitions, 4928 flow. Second operand 10 states and 125 transitions. [2022-12-13 13:39:48,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 272 transitions, 6316 flow [2022-12-13 13:39:48,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 272 transitions, 5992 flow, removed 162 selfloop flow, removed 0 redundant places. [2022-12-13 13:39:48,388 INFO L231 Difference]: Finished difference. Result has 165 places, 227 transitions, 5285 flow [2022-12-13 13:39:48,388 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4670, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5285, PETRI_PLACES=165, PETRI_TRANSITIONS=227} [2022-12-13 13:39:48,388 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 144 predicate places. [2022-12-13 13:39:48,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:48,388 INFO L89 Accepts]: Start accepts. Operand has 165 places, 227 transitions, 5285 flow [2022-12-13 13:39:48,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:48,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:48,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 227 transitions, 5285 flow [2022-12-13 13:39:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 227 transitions, 5285 flow [2022-12-13 13:39:48,496 INFO L130 PetriNetUnfolder]: 275/966 cut-off events. [2022-12-13 13:39:48,496 INFO L131 PetriNetUnfolder]: For 28306/28538 co-relation queries the response was YES. [2022-12-13 13:39:48,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8515 conditions, 966 events. 275/966 cut-off events. For 28306/28538 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8169 event pairs, 53 based on Foata normal form. 36/954 useless extension candidates. Maximal degree in co-relation 8323. Up to 329 conditions per place. [2022-12-13 13:39:48,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 227 transitions, 5285 flow [2022-12-13 13:39:48,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 718 [2022-12-13 13:39:48,509 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:48,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 13:39:48,510 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 227 transitions, 5285 flow [2022-12-13 13:39:48,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:48,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:48,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:48,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 13:39:48,715 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,SelfDestructingSolverStorable27 [2022-12-13 13:39:48,715 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1992007668, now seen corresponding path program 1 times [2022-12-13 13:39:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866194177] [2022-12-13 13:39:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:48,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:48,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866194177] [2022-12-13 13:39:48,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866194177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:48,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786164211] [2022-12-13 13:39:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:48,927 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-13 13:39:48,946 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-13 13:39:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:49,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:39:49,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:49,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:49,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786164211] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:49,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:49,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 13:39:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532086131] [2022-12-13 13:39:49,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:49,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:39:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:39:49,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:39:49,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 13:39:49,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 227 transitions, 5285 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:49,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:49,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 13:39:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:50,189 INFO L130 PetriNetUnfolder]: 1375/2659 cut-off events. [2022-12-13 13:39:50,189 INFO L131 PetriNetUnfolder]: For 78201/78201 co-relation queries the response was YES. [2022-12-13 13:39:50,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24795 conditions, 2659 events. 1375/2659 cut-off events. For 78201/78201 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18002 event pairs, 651 based on Foata normal form. 8/2657 useless extension candidates. Maximal degree in co-relation 24375. Up to 2339 conditions per place. [2022-12-13 13:39:50,210 INFO L137 encePairwiseOnDemand]: 37/58 looper letters, 207 selfloop transitions, 59 changer transitions 7/273 dead transitions. [2022-12-13 13:39:50,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 273 transitions, 6636 flow [2022-12-13 13:39:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:39:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:39:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-13 13:39:50,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20114942528735633 [2022-12-13 13:39:50,224 INFO L175 Difference]: Start difference. First operand has 164 places, 227 transitions, 5285 flow. Second operand 9 states and 105 transitions. [2022-12-13 13:39:50,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 273 transitions, 6636 flow [2022-12-13 13:39:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 273 transitions, 6406 flow, removed 88 selfloop flow, removed 5 redundant places. [2022-12-13 13:39:50,412 INFO L231 Difference]: Finished difference. Result has 172 places, 239 transitions, 5610 flow [2022-12-13 13:39:50,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=5109, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5610, PETRI_PLACES=172, PETRI_TRANSITIONS=239} [2022-12-13 13:39:50,413 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 151 predicate places. [2022-12-13 13:39:50,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:50,413 INFO L89 Accepts]: Start accepts. Operand has 172 places, 239 transitions, 5610 flow [2022-12-13 13:39:50,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:50,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:50,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 239 transitions, 5610 flow [2022-12-13 13:39:50,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 239 transitions, 5610 flow [2022-12-13 13:39:50,534 INFO L130 PetriNetUnfolder]: 288/1008 cut-off events. [2022-12-13 13:39:50,535 INFO L131 PetriNetUnfolder]: For 30870/31088 co-relation queries the response was YES. [2022-12-13 13:39:50,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9010 conditions, 1008 events. 288/1008 cut-off events. For 30870/31088 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8607 event pairs, 54 based on Foata normal form. 26/985 useless extension candidates. Maximal degree in co-relation 8813. Up to 348 conditions per place. [2022-12-13 13:39:50,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 239 transitions, 5610 flow [2022-12-13 13:39:50,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 13:39:50,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_295| v_~f~0.base_194))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_194 (* v_~x2~0_258 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_194 (* 4 .cse8))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_194 (* .cse0 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_194 (* .cse6 4))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_194 (* .cse3 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_194 (* .cse7 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_194 (* v_~x1~0_322 4)))) (.cse2 (* (mod v_~n~0_197 2147483648) 2)) (.cse5 (select .cse4 (+ v_~f~0.offset_194 (* .cse9 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_216| (+ |v_thread2Thread1of1ForFork1_~i~1#1_218| 8)) (not (= (ite (and (< .cse0 v_~size~0_198) (<= 0 .cse0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_198)) 1 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_216|) 4294967296) .cse2) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_216|) 4294967296) .cse2) (< (mod (+ 4294967290 |v_thread2Thread1of1ForFork1_~i~1#1_216|) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_198)) 1 0) 0)) (= v_~x2~0_256 (select .cse4 (+ v_~f~0.offset_194 (* .cse5 4)))) (not (= (ite (and (< .cse6 v_~size~0_198) (<= 0 .cse6)) 1 0) 0)) (= v_~x1~0_321 (select .cse4 (+ v_~f~0.offset_194 (* 4 .cse1)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_272| 4294967295) 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_198)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_157| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_273| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x1~0_322) (< v_~x1~0_322 v_~size~0_198)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_218| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_198)) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_273| 2) |v_thread1Thread1of1ForFork0_~i~0#1_272|) (not (= (ite (and (< .cse7 v_~size~0_198) (<= 0 .cse7)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|) (not (= (ite (and (< .cse8 v_~size~0_198) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_198)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_194, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_273|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_218|, ~n~0=v_~n~0_197, ~x1~0=v_~x1~0_322, ~f~0.offset=v_~f~0.offset_194} OutVars{~x2~0=v_~x2~0_256, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_175|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_121|, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_194, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_216|, ~x1~0=v_~x1~0_321, ~f~0.offset=v_~f~0.offset_194, 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_157|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_272|, #memory_int=|v_#memory_int_295|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_111|, ~n~0=v_~n~0_197, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_111|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_183|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:53,519 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:39:53,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3107 [2022-12-13 13:39:53,520 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 239 transitions, 5645 flow [2022-12-13 13:39:53,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:53,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:53,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:53,526 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-13 13:39:53,720 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,SelfDestructingSolverStorable28 [2022-12-13 13:39:53,721 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash -980016756, now seen corresponding path program 1 times [2022-12-13 13:39:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:53,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925446578] [2022-12-13 13:39:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:53,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:53,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:53,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925446578] [2022-12-13 13:39:53,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925446578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:53,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:53,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:39:53,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380186705] [2022-12-13 13:39:53,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:53,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:39:53,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:53,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:39:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:39:53,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 13:39:53,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 239 transitions, 5645 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:53,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:53,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 13:39:53,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:54,488 INFO L130 PetriNetUnfolder]: 1361/2644 cut-off events. [2022-12-13 13:39:54,489 INFO L131 PetriNetUnfolder]: For 79011/79011 co-relation queries the response was YES. [2022-12-13 13:39:54,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24678 conditions, 2644 events. 1361/2644 cut-off events. For 79011/79011 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 17983 event pairs, 562 based on Foata normal form. 12/2646 useless extension candidates. Maximal degree in co-relation 24253. Up to 1938 conditions per place. [2022-12-13 13:39:54,510 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 181 selfloop transitions, 83 changer transitions 5/269 dead transitions. [2022-12-13 13:39:54,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 269 transitions, 6613 flow [2022-12-13 13:39:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 13:39:54,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29491525423728815 [2022-12-13 13:39:54,511 INFO L175 Difference]: Start difference. First operand has 172 places, 239 transitions, 5645 flow. Second operand 5 states and 87 transitions. [2022-12-13 13:39:54,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 269 transitions, 6613 flow [2022-12-13 13:39:54,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 269 transitions, 6449 flow, removed 65 selfloop flow, removed 2 redundant places. [2022-12-13 13:39:54,705 INFO L231 Difference]: Finished difference. Result has 177 places, 240 transitions, 5776 flow [2022-12-13 13:39:54,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=5481, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5776, PETRI_PLACES=177, PETRI_TRANSITIONS=240} [2022-12-13 13:39:54,705 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 156 predicate places. [2022-12-13 13:39:54,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:54,705 INFO L89 Accepts]: Start accepts. Operand has 177 places, 240 transitions, 5776 flow [2022-12-13 13:39:54,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:54,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:54,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 240 transitions, 5776 flow [2022-12-13 13:39:54,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 240 transitions, 5776 flow [2022-12-13 13:39:54,823 INFO L130 PetriNetUnfolder]: 285/1002 cut-off events. [2022-12-13 13:39:54,824 INFO L131 PetriNetUnfolder]: For 33057/33269 co-relation queries the response was YES. [2022-12-13 13:39:54,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9221 conditions, 1002 events. 285/1002 cut-off events. For 33057/33269 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8571 event pairs, 54 based on Foata normal form. 33/988 useless extension candidates. Maximal degree in co-relation 9008. Up to 347 conditions per place. [2022-12-13 13:39:54,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 240 transitions, 5776 flow [2022-12-13 13:39:54,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 13:39:54,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:54,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:39:55,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [633] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_231| v_~f~0.base_140))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_140 (* v_~x2~0_148 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_140 (* .cse1 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_140 (* .cse4 4)))) (.cse3 (* 2 (mod v_~n~0_145 2147483648)))) (and (= (ite (and (< .cse0 v_~size~0_146) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= (ite (and (< v_~x2~0_148 v_~size~0_146) (<= 0 v_~x2~0_148)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_110| (+ |v_thread2Thread1of1ForFork1_~i~1#1_112| 4)) (not (= (ite (and (< .cse1 v_~size~0_146) (<= 0 .cse1)) 1 0) 0)) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_140 (* .cse0 4)))) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_112|) 4294967296) .cse3) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= (ite (and (< .cse4 v_~size~0_146) (<= 0 .cse4)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_112| 4294967296) .cse3)))))) InVars {~x2~0=v_~x2~0_148, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_140, #memory_int=|v_#memory_int_231|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~n~0=v_~n~0_145, ~f~0.offset=v_~f~0.offset_140} OutVars{~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_140, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_110|, ~f~0.offset=v_~f~0.offset_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, #memory_int=|v_#memory_int_231|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_145, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:39:55,384 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:39:55,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 679 [2022-12-13 13:39:55,384 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 240 transitions, 5789 flow [2022-12-13 13:39:55,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:55,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:55,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:55,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 13:39:55,385 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash -558960001, now seen corresponding path program 1 times [2022-12-13 13:39:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:55,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868308825] [2022-12-13 13:39:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:55,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868308825] [2022-12-13 13:39:55,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868308825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:55,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975896240] [2022-12-13 13:39:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:39:55,556 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-13 13:39:55,558 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-13 13:39:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:55,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:39:55,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:55,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:39:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:55,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975896240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:39:55,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:39:55,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 13:39:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784685447] [2022-12-13 13:39:55,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:39:55,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:39:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:39:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:39:55,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 13:39:55,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 240 transitions, 5789 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:55,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:55,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 13:39:55,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:56,679 INFO L130 PetriNetUnfolder]: 1383/2679 cut-off events. [2022-12-13 13:39:56,679 INFO L131 PetriNetUnfolder]: For 86579/86579 co-relation queries the response was YES. [2022-12-13 13:39:56,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25778 conditions, 2679 events. 1383/2679 cut-off events. For 86579/86579 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 18156 event pairs, 641 based on Foata normal form. 8/2677 useless extension candidates. Maximal degree in co-relation 25315. Up to 2321 conditions per place. [2022-12-13 13:39:56,706 INFO L137 encePairwiseOnDemand]: 38/60 looper letters, 205 selfloop transitions, 64 changer transitions 7/276 dead transitions. [2022-12-13 13:39:56,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 276 transitions, 6920 flow [2022-12-13 13:39:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:39:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:39:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-13 13:39:56,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21458333333333332 [2022-12-13 13:39:56,707 INFO L175 Difference]: Start difference. First operand has 178 places, 240 transitions, 5789 flow. Second operand 8 states and 103 transitions. [2022-12-13 13:39:56,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 276 transitions, 6920 flow [2022-12-13 13:39:56,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 276 transitions, 6814 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 13:39:56,969 INFO L231 Difference]: Finished difference. Result has 185 places, 245 transitions, 6034 flow [2022-12-13 13:39:56,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5686, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6034, PETRI_PLACES=185, PETRI_TRANSITIONS=245} [2022-12-13 13:39:56,970 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-13 13:39:56,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:56,970 INFO L89 Accepts]: Start accepts. Operand has 185 places, 245 transitions, 6034 flow [2022-12-13 13:39:56,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:56,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:56,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 245 transitions, 6034 flow [2022-12-13 13:39:56,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 245 transitions, 6034 flow [2022-12-13 13:39:57,113 INFO L130 PetriNetUnfolder]: 291/1019 cut-off events. [2022-12-13 13:39:57,114 INFO L131 PetriNetUnfolder]: For 36792/37016 co-relation queries the response was YES. [2022-12-13 13:39:57,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9629 conditions, 1019 events. 291/1019 cut-off events. For 36792/37016 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8738 event pairs, 55 based on Foata normal form. 33/1004 useless extension candidates. Maximal degree in co-relation 9419. Up to 356 conditions per place. [2022-12-13 13:39:57,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 245 transitions, 6034 flow [2022-12-13 13:39:57,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-13 13:39:57,129 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:57,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 13:39:57,129 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 245 transitions, 6034 flow [2022-12-13 13:39:57,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:57,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:57,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:57,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 13:39:57,332 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,SelfDestructingSolverStorable30 [2022-12-13 13:39:57,332 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash 107590778, now seen corresponding path program 2 times [2022-12-13 13:39:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:57,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454947419] [2022-12-13 13:39:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:57,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454947419] [2022-12-13 13:39:57,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454947419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:57,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:57,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:39:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996045779] [2022-12-13 13:39:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:57,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:39:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:57,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:39:57,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:39:57,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 13:39:57,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 245 transitions, 6034 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:57,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:57,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 13:39:57,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:58,070 INFO L130 PetriNetUnfolder]: 1378/2695 cut-off events. [2022-12-13 13:39:58,070 INFO L131 PetriNetUnfolder]: For 91955/91955 co-relation queries the response was YES. [2022-12-13 13:39:58,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26270 conditions, 2695 events. 1378/2695 cut-off events. For 91955/91955 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18464 event pairs, 576 based on Foata normal form. 4/2689 useless extension candidates. Maximal degree in co-relation 25820. Up to 1986 conditions per place. [2022-12-13 13:39:58,097 INFO L137 encePairwiseOnDemand]: 20/60 looper letters, 172 selfloop transitions, 99 changer transitions 3/274 dead transitions. [2022-12-13 13:39:58,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 274 transitions, 7015 flow [2022-12-13 13:39:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 13:39:58,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 13:39:58,098 INFO L175 Difference]: Start difference. First operand has 185 places, 245 transitions, 6034 flow. Second operand 5 states and 90 transitions. [2022-12-13 13:39:58,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 274 transitions, 7015 flow [2022-12-13 13:39:58,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 274 transitions, 6854 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-13 13:39:58,390 INFO L231 Difference]: Finished difference. Result has 187 places, 247 transitions, 6182 flow [2022-12-13 13:39:58,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5878, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6182, PETRI_PLACES=187, PETRI_TRANSITIONS=247} [2022-12-13 13:39:58,391 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-13 13:39:58,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:39:58,391 INFO L89 Accepts]: Start accepts. Operand has 187 places, 247 transitions, 6182 flow [2022-12-13 13:39:58,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:39:58,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:39:58,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 247 transitions, 6182 flow [2022-12-13 13:39:58,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 247 transitions, 6182 flow [2022-12-13 13:39:58,523 INFO L130 PetriNetUnfolder]: 289/1031 cut-off events. [2022-12-13 13:39:58,523 INFO L131 PetriNetUnfolder]: For 37263/37466 co-relation queries the response was YES. [2022-12-13 13:39:58,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9804 conditions, 1031 events. 289/1031 cut-off events. For 37263/37466 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8948 event pairs, 53 based on Foata normal form. 28/1015 useless extension candidates. Maximal degree in co-relation 9579. Up to 351 conditions per place. [2022-12-13 13:39:58,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 247 transitions, 6182 flow [2022-12-13 13:39:58,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-13 13:39:58,551 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:39:58,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 13:39:58,552 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 247 transitions, 6182 flow [2022-12-13 13:39:58,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:58,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:39:58,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:58,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 13:39:58,552 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:39:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -329889358, now seen corresponding path program 1 times [2022-12-13 13:39:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:58,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066507884] [2022-12-13 13:39:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:58,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:58,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066507884] [2022-12-13 13:39:58,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066507884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:39:58,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:39:58,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:39:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938408199] [2022-12-13 13:39:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:39:58,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:39:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:39:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:39:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:39:58,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 13:39:58,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 247 transitions, 6182 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:39:58,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:39:58,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 13:39:58,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:39:59,779 INFO L130 PetriNetUnfolder]: 1415/2766 cut-off events. [2022-12-13 13:39:59,779 INFO L131 PetriNetUnfolder]: For 92240/92240 co-relation queries the response was YES. [2022-12-13 13:39:59,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27182 conditions, 2766 events. 1415/2766 cut-off events. For 92240/92240 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 18976 event pairs, 401 based on Foata normal form. 3/2759 useless extension candidates. Maximal degree in co-relation 26700. Up to 2242 conditions per place. [2022-12-13 13:39:59,806 INFO L137 encePairwiseOnDemand]: 20/60 looper letters, 175 selfloop transitions, 93 changer transitions 8/276 dead transitions. [2022-12-13 13:39:59,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 276 transitions, 7125 flow [2022-12-13 13:39:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:39:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:39:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 13:39:59,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30333333333333334 [2022-12-13 13:39:59,807 INFO L175 Difference]: Start difference. First operand has 187 places, 247 transitions, 6182 flow. Second operand 5 states and 91 transitions. [2022-12-13 13:39:59,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 276 transitions, 7125 flow [2022-12-13 13:40:00,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 276 transitions, 6902 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-13 13:40:00,101 INFO L231 Difference]: Finished difference. Result has 190 places, 255 transitions, 6474 flow [2022-12-13 13:40:00,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5980, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6474, PETRI_PLACES=190, PETRI_TRANSITIONS=255} [2022-12-13 13:40:00,101 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 169 predicate places. [2022-12-13 13:40:00,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:00,101 INFO L89 Accepts]: Start accepts. Operand has 190 places, 255 transitions, 6474 flow [2022-12-13 13:40:00,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:00,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:00,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 255 transitions, 6474 flow [2022-12-13 13:40:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 255 transitions, 6474 flow [2022-12-13 13:40:00,236 INFO L130 PetriNetUnfolder]: 296/1063 cut-off events. [2022-12-13 13:40:00,236 INFO L131 PetriNetUnfolder]: For 38779/38990 co-relation queries the response was YES. [2022-12-13 13:40:00,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 1063 events. 296/1063 cut-off events. For 38779/38990 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9288 event pairs, 54 based on Foata normal form. 29/1047 useless extension candidates. Maximal degree in co-relation 9834. Up to 354 conditions per place. [2022-12-13 13:40:00,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 255 transitions, 6474 flow [2022-12-13 13:40:00,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 13:40:00,250 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:40:00,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 13:40:00,251 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 255 transitions, 6474 flow [2022-12-13 13:40:00,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:00,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:00,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:00,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 13:40:00,251 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -517894423, now seen corresponding path program 1 times [2022-12-13 13:40:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:00,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663035685] [2022-12-13 13:40:00,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663035685] [2022-12-13 13:40:00,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663035685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:00,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:00,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:40:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066642902] [2022-12-13 13:40:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:00,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:40:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:00,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:40:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:40:00,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 13:40:00,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 255 transitions, 6474 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:00,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:00,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 13:40:00,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:01,533 INFO L130 PetriNetUnfolder]: 1433/2792 cut-off events. [2022-12-13 13:40:01,534 INFO L131 PetriNetUnfolder]: For 94828/94828 co-relation queries the response was YES. [2022-12-13 13:40:01,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27471 conditions, 2792 events. 1433/2792 cut-off events. For 94828/94828 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 19162 event pairs, 484 based on Foata normal form. 1/2783 useless extension candidates. Maximal degree in co-relation 26988. Up to 2570 conditions per place. [2022-12-13 13:40:01,560 INFO L137 encePairwiseOnDemand]: 26/60 looper letters, 211 selfloop transitions, 61 changer transitions 4/276 dead transitions. [2022-12-13 13:40:01,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 276 transitions, 7324 flow [2022-12-13 13:40:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:40:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:40:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 13:40:01,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 13:40:01,562 INFO L175 Difference]: Start difference. First operand has 190 places, 255 transitions, 6474 flow. Second operand 5 states and 90 transitions. [2022-12-13 13:40:01,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 276 transitions, 7324 flow [2022-12-13 13:40:01,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 276 transitions, 7174 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 13:40:01,871 INFO L231 Difference]: Finished difference. Result has 193 places, 260 transitions, 6666 flow [2022-12-13 13:40:01,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=6327, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6666, PETRI_PLACES=193, PETRI_TRANSITIONS=260} [2022-12-13 13:40:01,872 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 172 predicate places. [2022-12-13 13:40:01,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:01,872 INFO L89 Accepts]: Start accepts. Operand has 193 places, 260 transitions, 6666 flow [2022-12-13 13:40:01,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:01,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:01,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 260 transitions, 6666 flow [2022-12-13 13:40:01,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 260 transitions, 6666 flow [2022-12-13 13:40:02,015 INFO L130 PetriNetUnfolder]: 301/1075 cut-off events. [2022-12-13 13:40:02,016 INFO L131 PetriNetUnfolder]: For 40474/40695 co-relation queries the response was YES. [2022-12-13 13:40:02,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10255 conditions, 1075 events. 301/1075 cut-off events. For 40474/40695 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9398 event pairs, 55 based on Foata normal form. 30/1057 useless extension candidates. Maximal degree in co-relation 10030. Up to 356 conditions per place. [2022-12-13 13:40:02,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 260 transitions, 6666 flow [2022-12-13 13:40:02,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-13 13:40:02,031 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:40:02,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 13:40:02,034 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 260 transitions, 6666 flow [2022-12-13 13:40:02,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:02,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:02,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:02,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 13:40:02,034 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1956202965, now seen corresponding path program 1 times [2022-12-13 13:40:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:02,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222474796] [2022-12-13 13:40:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:02,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222474796] [2022-12-13 13:40:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222474796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:02,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:02,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:40:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808592402] [2022-12-13 13:40:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:02,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:40:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:02,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:40:02,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:40:02,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 13:40:02,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 260 transitions, 6666 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:02,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:02,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 13:40:02,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:02,912 INFO L130 PetriNetUnfolder]: 1664/3225 cut-off events. [2022-12-13 13:40:02,912 INFO L131 PetriNetUnfolder]: For 118549/118549 co-relation queries the response was YES. [2022-12-13 13:40:02,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32171 conditions, 3225 events. 1664/3225 cut-off events. For 118549/118549 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 22523 event pairs, 548 based on Foata normal form. 4/3219 useless extension candidates. Maximal degree in co-relation 31624. Up to 2006 conditions per place. [2022-12-13 13:40:02,938 INFO L137 encePairwiseOnDemand]: 22/60 looper letters, 184 selfloop transitions, 134 changer transitions 2/320 dead transitions. [2022-12-13 13:40:02,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 320 transitions, 8307 flow [2022-12-13 13:40:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:40:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:40:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-13 13:40:02,939 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24761904761904763 [2022-12-13 13:40:02,939 INFO L175 Difference]: Start difference. First operand has 193 places, 260 transitions, 6666 flow. Second operand 7 states and 104 transitions. [2022-12-13 13:40:02,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 320 transitions, 8307 flow [2022-12-13 13:40:03,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 320 transitions, 8177 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-13 13:40:03,207 INFO L231 Difference]: Finished difference. Result has 201 places, 279 transitions, 7464 flow [2022-12-13 13:40:03,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=6542, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7464, PETRI_PLACES=201, PETRI_TRANSITIONS=279} [2022-12-13 13:40:03,207 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 180 predicate places. [2022-12-13 13:40:03,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:03,207 INFO L89 Accepts]: Start accepts. Operand has 201 places, 279 transitions, 7464 flow [2022-12-13 13:40:03,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:03,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:03,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 279 transitions, 7464 flow [2022-12-13 13:40:03,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 279 transitions, 7464 flow [2022-12-13 13:40:03,365 INFO L130 PetriNetUnfolder]: 344/1215 cut-off events. [2022-12-13 13:40:03,365 INFO L131 PetriNetUnfolder]: For 49638/49905 co-relation queries the response was YES. [2022-12-13 13:40:03,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12060 conditions, 1215 events. 344/1215 cut-off events. For 49638/49905 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10839 event pairs, 70 based on Foata normal form. 32/1187 useless extension candidates. Maximal degree in co-relation 11800. Up to 426 conditions per place. [2022-12-13 13:40:03,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 279 transitions, 7464 flow [2022-12-13 13:40:03,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 13:40:03,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:40:03,479 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:03,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-13 13:40:03,480 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 278 transitions, 7460 flow [2022-12-13 13:40:03,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:03,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:03,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:03,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 13:40:03,480 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2011078081, now seen corresponding path program 2 times [2022-12-13 13:40:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281577362] [2022-12-13 13:40:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:03,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281577362] [2022-12-13 13:40:03,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281577362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:03,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:03,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:40:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623973394] [2022-12-13 13:40:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:03,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:40:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:40:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:40:03,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 13:40:03,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 278 transitions, 7460 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:03,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:03,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 13:40:03,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:04,391 INFO L130 PetriNetUnfolder]: 1671/3228 cut-off events. [2022-12-13 13:40:04,391 INFO L131 PetriNetUnfolder]: For 124286/124286 co-relation queries the response was YES. [2022-12-13 13:40:04,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33314 conditions, 3228 events. 1671/3228 cut-off events. For 124286/124286 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 22436 event pairs, 362 based on Foata normal form. 22/3240 useless extension candidates. Maximal degree in co-relation 32746. Up to 1861 conditions per place. [2022-12-13 13:40:04,423 INFO L137 encePairwiseOnDemand]: 20/61 looper letters, 207 selfloop transitions, 123 changer transitions 0/330 dead transitions. [2022-12-13 13:40:04,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 330 transitions, 8971 flow [2022-12-13 13:40:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:40:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:40:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-13 13:40:04,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19672131147540983 [2022-12-13 13:40:04,424 INFO L175 Difference]: Start difference. First operand has 200 places, 278 transitions, 7460 flow. Second operand 9 states and 108 transitions. [2022-12-13 13:40:04,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 330 transitions, 8971 flow [2022-12-13 13:40:04,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 330 transitions, 8900 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-13 13:40:04,751 INFO L231 Difference]: Finished difference. Result has 209 places, 282 transitions, 7806 flow [2022-12-13 13:40:04,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=7388, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7806, PETRI_PLACES=209, PETRI_TRANSITIONS=282} [2022-12-13 13:40:04,752 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-13 13:40:04,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:04,752 INFO L89 Accepts]: Start accepts. Operand has 209 places, 282 transitions, 7806 flow [2022-12-13 13:40:04,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:04,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:04,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 282 transitions, 7806 flow [2022-12-13 13:40:04,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 282 transitions, 7806 flow [2022-12-13 13:40:04,917 INFO L130 PetriNetUnfolder]: 348/1218 cut-off events. [2022-12-13 13:40:04,918 INFO L131 PetriNetUnfolder]: For 50696/50951 co-relation queries the response was YES. [2022-12-13 13:40:04,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12439 conditions, 1218 events. 348/1218 cut-off events. For 50696/50951 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 10869 event pairs, 70 based on Foata normal form. 26/1184 useless extension candidates. Maximal degree in co-relation 12170. Up to 433 conditions per place. [2022-12-13 13:40:04,933 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 282 transitions, 7806 flow [2022-12-13 13:40:04,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-13 13:40:04,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:40:05,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:05,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 720 [2022-12-13 13:40:05,472 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 282 transitions, 7834 flow [2022-12-13 13:40:05,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:05,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:05,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:05,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 13:40:05,472 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:05,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1021788795, now seen corresponding path program 1 times [2022-12-13 13:40:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:05,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873052022] [2022-12-13 13:40:05,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:05,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:05,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:05,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873052022] [2022-12-13 13:40:05,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873052022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:05,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:05,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:40:05,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592328879] [2022-12-13 13:40:05,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:05,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:40:05,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:05,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:40:05,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:40:05,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 13:40:05,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 282 transitions, 7834 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:05,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:05,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 13:40:05,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:06,377 INFO L130 PetriNetUnfolder]: 1665/3206 cut-off events. [2022-12-13 13:40:06,378 INFO L131 PetriNetUnfolder]: For 126752/126752 co-relation queries the response was YES. [2022-12-13 13:40:06,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33879 conditions, 3206 events. 1665/3206 cut-off events. For 126752/126752 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 22445 event pairs, 212 based on Foata normal form. 2/3196 useless extension candidates. Maximal degree in co-relation 33290. Up to 1693 conditions per place. [2022-12-13 13:40:06,409 INFO L137 encePairwiseOnDemand]: 49/63 looper letters, 306 selfloop transitions, 30 changer transitions 8/344 dead transitions. [2022-12-13 13:40:06,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 344 transitions, 9964 flow [2022-12-13 13:40:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:40:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:40:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 13:40:06,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30158730158730157 [2022-12-13 13:40:06,410 INFO L175 Difference]: Start difference. First operand has 209 places, 282 transitions, 7834 flow. Second operand 4 states and 76 transitions. [2022-12-13 13:40:06,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 344 transitions, 9964 flow [2022-12-13 13:40:06,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 344 transitions, 9887 flow, removed 35 selfloop flow, removed 1 redundant places. [2022-12-13 13:40:06,765 INFO L231 Difference]: Finished difference. Result has 212 places, 280 transitions, 7786 flow [2022-12-13 13:40:06,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=7771, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7786, PETRI_PLACES=212, PETRI_TRANSITIONS=280} [2022-12-13 13:40:06,765 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2022-12-13 13:40:06,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:06,765 INFO L89 Accepts]: Start accepts. Operand has 212 places, 280 transitions, 7786 flow [2022-12-13 13:40:06,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:06,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:06,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 280 transitions, 7786 flow [2022-12-13 13:40:06,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 280 transitions, 7786 flow [2022-12-13 13:40:06,926 INFO L130 PetriNetUnfolder]: 347/1199 cut-off events. [2022-12-13 13:40:06,926 INFO L131 PetriNetUnfolder]: For 54422/54677 co-relation queries the response was YES. [2022-12-13 13:40:06,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12453 conditions, 1199 events. 347/1199 cut-off events. For 54422/54677 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10618 event pairs, 70 based on Foata normal form. 26/1166 useless extension candidates. Maximal degree in co-relation 12180. Up to 430 conditions per place. [2022-12-13 13:40:06,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 280 transitions, 7786 flow [2022-12-13 13:40:06,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-13 13:40:06,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:40:07,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:07,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 574 [2022-12-13 13:40:07,339 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 280 transitions, 7814 flow [2022-12-13 13:40:07,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:07,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:07,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:07,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 13:40:07,339 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:07,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1067657384, now seen corresponding path program 1 times [2022-12-13 13:40:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:07,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380114421] [2022-12-13 13:40:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380114421] [2022-12-13 13:40:07,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380114421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721214883] [2022-12-13 13:40:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:07,462 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-13 13:40:07,464 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-13 13:40:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:07,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:40:07,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:07,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:07,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721214883] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:07,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:07,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-13 13:40:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977323875] [2022-12-13 13:40:07,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:07,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:40:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:40:07,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:40:07,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 13:40:07,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 280 transitions, 7814 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:07,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:07,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 13:40:07,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:09,267 INFO L130 PetriNetUnfolder]: 1715/3298 cut-off events. [2022-12-13 13:40:09,267 INFO L131 PetriNetUnfolder]: For 146004/146004 co-relation queries the response was YES. [2022-12-13 13:40:09,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35378 conditions, 3298 events. 1715/3298 cut-off events. For 146004/146004 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 23035 event pairs, 682 based on Foata normal form. 46/3332 useless extension candidates. Maximal degree in co-relation 34780. Up to 2145 conditions per place. [2022-12-13 13:40:09,306 INFO L137 encePairwiseOnDemand]: 19/64 looper letters, 198 selfloop transitions, 150 changer transitions 5/353 dead transitions. [2022-12-13 13:40:09,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 353 transitions, 9892 flow [2022-12-13 13:40:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:40:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:40:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-12-13 13:40:09,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17307692307692307 [2022-12-13 13:40:09,308 INFO L175 Difference]: Start difference. First operand has 211 places, 280 transitions, 7814 flow. Second operand 13 states and 144 transitions. [2022-12-13 13:40:09,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 353 transitions, 9892 flow [2022-12-13 13:40:09,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 353 transitions, 9700 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-13 13:40:09,704 INFO L231 Difference]: Finished difference. Result has 226 places, 301 transitions, 8663 flow [2022-12-13 13:40:09,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=7638, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8663, PETRI_PLACES=226, PETRI_TRANSITIONS=301} [2022-12-13 13:40:09,705 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 205 predicate places. [2022-12-13 13:40:09,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:09,705 INFO L89 Accepts]: Start accepts. Operand has 226 places, 301 transitions, 8663 flow [2022-12-13 13:40:09,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:09,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:09,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 301 transitions, 8663 flow [2022-12-13 13:40:09,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 301 transitions, 8663 flow [2022-12-13 13:40:09,885 INFO L130 PetriNetUnfolder]: 365/1244 cut-off events. [2022-12-13 13:40:09,885 INFO L131 PetriNetUnfolder]: For 65906/66304 co-relation queries the response was YES. [2022-12-13 13:40:09,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14278 conditions, 1244 events. 365/1244 cut-off events. For 65906/66304 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 11017 event pairs, 70 based on Foata normal form. 31/1219 useless extension candidates. Maximal degree in co-relation 14168. Up to 448 conditions per place. [2022-12-13 13:40:09,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 301 transitions, 8663 flow [2022-12-13 13:40:09,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-13 13:40:10,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:40:10,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-13 13:40:10,486 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:40:10,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [681] L49-2-->thread2EXIT: Formula: (let ((.cse0 (* 2 (mod v_~n~0_225 2147483648)))) (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_43| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_334| (+ |v_thread1Thread1of1ForFork0_~i~0#1_335| 1)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_269| 4294967296) .cse0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| (ite (and (< v_~x1~0_378 v_~size~0_226) (<= 0 v_~x1~0_378)) 1 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_335| 4294967296) .cse0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_43|) (= v_~x1~0_377 (select (select |v_#memory_int_326| v_~f~0.base_222) (+ v_~f~0.offset_222 (* v_~x1~0_378 4)))))) InVars {~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_222, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_335|, #memory_int=|v_#memory_int_326|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_269|, ~n~0=v_~n~0_225, ~x1~0=v_~x1~0_378, ~f~0.offset=v_~f~0.offset_222} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_210|, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_222, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_43|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_269|, ~x1~0=v_~x1~0_377, ~f~0.offset=v_~f~0.offset_222, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_43|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_334|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_208|, #memory_int=|v_#memory_int_326|, ~n~0=v_~n~0_225, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_218|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:40:10,815 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:40:10,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1111 [2022-12-13 13:40:10,816 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 300 transitions, 8747 flow [2022-12-13 13:40:10,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:10,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:10,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:10,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 13:40:11,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:11,017 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -81762572, now seen corresponding path program 2 times [2022-12-13 13:40:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:11,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5385061] [2022-12-13 13:40:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5385061] [2022-12-13 13:40:11,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5385061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:11,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:11,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:40:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669993687] [2022-12-13 13:40:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:40:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:11,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:40:11,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:40:11,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-13 13:40:11,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 300 transitions, 8747 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:11,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:11,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-13 13:40:11,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:11,977 INFO L130 PetriNetUnfolder]: 1706/3285 cut-off events. [2022-12-13 13:40:11,977 INFO L131 PetriNetUnfolder]: For 162481/162481 co-relation queries the response was YES. [2022-12-13 13:40:11,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38306 conditions, 3285 events. 1706/3285 cut-off events. For 162481/162481 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22892 event pairs, 852 based on Foata normal form. 4/3279 useless extension candidates. Maximal degree in co-relation 37995. Up to 3135 conditions per place. [2022-12-13 13:40:12,012 INFO L137 encePairwiseOnDemand]: 47/69 looper letters, 283 selfloop transitions, 30 changer transitions 6/319 dead transitions. [2022-12-13 13:40:12,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 319 transitions, 9764 flow [2022-12-13 13:40:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:40:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:40:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 13:40:12,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.263768115942029 [2022-12-13 13:40:12,014 INFO L175 Difference]: Start difference. First operand has 224 places, 300 transitions, 8747 flow. Second operand 5 states and 91 transitions. [2022-12-13 13:40:12,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 319 transitions, 9764 flow [2022-12-13 13:40:12,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 319 transitions, 9571 flow, removed 91 selfloop flow, removed 3 redundant places. [2022-12-13 13:40:12,557 INFO L231 Difference]: Finished difference. Result has 226 places, 301 transitions, 8685 flow [2022-12-13 13:40:12,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=8558, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8685, PETRI_PLACES=226, PETRI_TRANSITIONS=301} [2022-12-13 13:40:12,558 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 205 predicate places. [2022-12-13 13:40:12,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:12,558 INFO L89 Accepts]: Start accepts. Operand has 226 places, 301 transitions, 8685 flow [2022-12-13 13:40:12,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:12,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:12,560 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 301 transitions, 8685 flow [2022-12-13 13:40:12,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 301 transitions, 8685 flow [2022-12-13 13:40:12,741 INFO L130 PetriNetUnfolder]: 364/1207 cut-off events. [2022-12-13 13:40:12,741 INFO L131 PetriNetUnfolder]: For 68561/69026 co-relation queries the response was YES. [2022-12-13 13:40:12,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14298 conditions, 1207 events. 364/1207 cut-off events. For 68561/69026 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10462 event pairs, 66 based on Foata normal form. 27/1176 useless extension candidates. Maximal degree in co-relation 14001. Up to 442 conditions per place. [2022-12-13 13:40:12,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 301 transitions, 8685 flow [2022-12-13 13:40:12,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 918 [2022-12-13 13:40:12,763 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:40:12,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-13 13:40:12,763 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 301 transitions, 8685 flow [2022-12-13 13:40:12,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:12,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:12,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:12,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 13:40:12,764 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1996289839, now seen corresponding path program 1 times [2022-12-13 13:40:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:12,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276356664] [2022-12-13 13:40:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:13,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276356664] [2022-12-13 13:40:13,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276356664] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:13,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738008242] [2022-12-13 13:40:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:13,941 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-13 13:40:13,942 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-13 13:40:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:14,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:40:14,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:14,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:40:14,070 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 14 treesize of output 16 [2022-12-13 13:40:14,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:14,163 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 13:40:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:14,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:14,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:14,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 13:40:14,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:14,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 13:40:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:19,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738008242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:19,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:19,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:40:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184146068] [2022-12-13 13:40:19,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:19,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:40:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:40:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:40:19,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-13 13:40:19,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 301 transitions, 8685 flow. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:19,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:19,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-13 13:40:19,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:21,234 INFO L130 PetriNetUnfolder]: 1802/3412 cut-off events. [2022-12-13 13:40:21,235 INFO L131 PetriNetUnfolder]: For 180923/180923 co-relation queries the response was YES. [2022-12-13 13:40:21,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41282 conditions, 3412 events. 1802/3412 cut-off events. For 180923/180923 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 23536 event pairs, 559 based on Foata normal form. 2/3404 useless extension candidates. Maximal degree in co-relation 40631. Up to 3023 conditions per place. [2022-12-13 13:40:21,272 INFO L137 encePairwiseOnDemand]: 32/69 looper letters, 256 selfloop transitions, 94 changer transitions 5/355 dead transitions. [2022-12-13 13:40:21,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 355 transitions, 10357 flow [2022-12-13 13:40:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:40:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:40:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2022-12-13 13:40:21,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17391304347826086 [2022-12-13 13:40:21,273 INFO L175 Difference]: Start difference. First operand has 225 places, 301 transitions, 8685 flow. Second operand 11 states and 132 transitions. [2022-12-13 13:40:21,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 355 transitions, 10357 flow [2022-12-13 13:40:21,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 355 transitions, 10281 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 13:40:21,776 INFO L231 Difference]: Finished difference. Result has 237 places, 319 transitions, 9450 flow [2022-12-13 13:40:21,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=8611, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9450, PETRI_PLACES=237, PETRI_TRANSITIONS=319} [2022-12-13 13:40:21,777 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 216 predicate places. [2022-12-13 13:40:21,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:21,777 INFO L89 Accepts]: Start accepts. Operand has 237 places, 319 transitions, 9450 flow [2022-12-13 13:40:21,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:21,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:21,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 319 transitions, 9450 flow [2022-12-13 13:40:21,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 319 transitions, 9450 flow [2022-12-13 13:40:21,978 INFO L130 PetriNetUnfolder]: 388/1286 cut-off events. [2022-12-13 13:40:21,979 INFO L131 PetriNetUnfolder]: For 76635/77137 co-relation queries the response was YES. [2022-12-13 13:40:21,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15633 conditions, 1286 events. 388/1286 cut-off events. For 76635/77137 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11313 event pairs, 71 based on Foata normal form. 27/1252 useless extension candidates. Maximal degree in co-relation 15332. Up to 481 conditions per place. [2022-12-13 13:40:22,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 319 transitions, 9450 flow [2022-12-13 13:40:22,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 986 [2022-12-13 13:40:22,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [680] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_324| v_~f~0.base_220))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_220 (* v_~x2~0_315 4)))) (.cse0 (* 2 (mod v_~n~0_223 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196| 0)) (= (ite (and (< v_~x1~0_374 v_~size~0_224) (<= 0 v_~x1~0_374)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_331| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_220 (* .cse2 4))) v_~x2~0_314) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (and (< .cse2 v_~size~0_224) (<= 0 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_266|) |v_thread2Thread1of1ForFork1_~i~1#1_265|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_266| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_330| (+ |v_thread1Thread1of1ForFork0_~i~0#1_331| 1)) (= (select .cse1 (+ v_~f~0.offset_220 (* v_~x1~0_374 4))) v_~x1~0_373) (not (= (ite (and (<= 0 v_~x2~0_315) (< v_~x2~0_315 v_~size~0_224)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_315, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_220, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_331|, #memory_int=|v_#memory_int_324|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_266|, ~n~0=v_~n~0_223, ~x1~0=v_~x1~0_374, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_314, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_162|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_265|, ~x1~0=v_~x1~0_373, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_330|, #memory_int=|v_#memory_int_324|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_148|, ~n~0=v_~n~0_223, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_148|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_216|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:40:22,241 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:22,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 466 [2022-12-13 13:40:22,243 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 319 transitions, 9516 flow [2022-12-13 13:40:22,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:22,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:22,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:22,248 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-13 13:40:22,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 13:40:22,449 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1321212823, now seen corresponding path program 1 times [2022-12-13 13:40:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:22,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465394320] [2022-12-13 13:40:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:22,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:22,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465394320] [2022-12-13 13:40:22,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465394320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:22,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592178800] [2022-12-13 13:40:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:22,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:22,978 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:40:23,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 13:40:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:23,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:40:23,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:23,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:40:23,128 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 22 treesize of output 24 [2022-12-13 13:40:23,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:23,184 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-13 13:40:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:40:23,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:40:23,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592178800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:23,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:40:23,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-13 13:40:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971979799] [2022-12-13 13:40:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:23,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:40:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:40:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:40:23,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 13:40:23,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 319 transitions, 9516 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:23,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:23,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 13:40:23,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:24,152 INFO L130 PetriNetUnfolder]: 1845/3503 cut-off events. [2022-12-13 13:40:24,152 INFO L131 PetriNetUnfolder]: For 190185/190185 co-relation queries the response was YES. [2022-12-13 13:40:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42861 conditions, 3503 events. 1845/3503 cut-off events. For 190185/190185 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24228 event pairs, 514 based on Foata normal form. 3/3496 useless extension candidates. Maximal degree in co-relation 42206. Up to 3059 conditions per place. [2022-12-13 13:40:24,189 INFO L137 encePairwiseOnDemand]: 29/70 looper letters, 237 selfloop transitions, 100 changer transitions 7/344 dead transitions. [2022-12-13 13:40:24,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 344 transitions, 10626 flow [2022-12-13 13:40:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:40:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:40:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 13:40:24,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26571428571428574 [2022-12-13 13:40:24,190 INFO L175 Difference]: Start difference. First operand has 237 places, 319 transitions, 9516 flow. Second operand 5 states and 93 transitions. [2022-12-13 13:40:24,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 344 transitions, 10626 flow [2022-12-13 13:40:24,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 344 transitions, 10291 flow, removed 139 selfloop flow, removed 4 redundant places. [2022-12-13 13:40:24,902 INFO L231 Difference]: Finished difference. Result has 239 places, 327 transitions, 9727 flow [2022-12-13 13:40:24,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=9183, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9727, PETRI_PLACES=239, PETRI_TRANSITIONS=327} [2022-12-13 13:40:24,903 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 218 predicate places. [2022-12-13 13:40:24,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:24,903 INFO L89 Accepts]: Start accepts. Operand has 239 places, 327 transitions, 9727 flow [2022-12-13 13:40:24,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:24,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:24,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 327 transitions, 9727 flow [2022-12-13 13:40:24,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 327 transitions, 9727 flow [2022-12-13 13:40:25,106 INFO L130 PetriNetUnfolder]: 397/1317 cut-off events. [2022-12-13 13:40:25,106 INFO L131 PetriNetUnfolder]: For 79339/79919 co-relation queries the response was YES. [2022-12-13 13:40:25,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15926 conditions, 1317 events. 397/1317 cut-off events. For 79339/79919 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 11596 event pairs, 70 based on Foata normal form. 44/1295 useless extension candidates. Maximal degree in co-relation 15620. Up to 490 conditions per place. [2022-12-13 13:40:25,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 327 transitions, 9727 flow [2022-12-13 13:40:25,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 1014 [2022-12-13 13:40:25,126 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:40:25,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-13 13:40:25,127 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 327 transitions, 9727 flow [2022-12-13 13:40:25,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:25,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:25,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:25,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 13:40:25,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:25,332 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -86933924, now seen corresponding path program 1 times [2022-12-13 13:40:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:25,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582278473] [2022-12-13 13:40:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:25,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:26,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582278473] [2022-12-13 13:40:26,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582278473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:26,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60112613] [2022-12-13 13:40:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:26,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:26,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:26,246 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:40:26,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:40:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:26,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 13:40:26,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:26,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:40:26,377 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 22 treesize of output 24 [2022-12-13 13:40:26,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:26,456 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 13:40:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:26,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:26,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:26,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 13:40:26,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:26,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 13:40:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:31,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60112613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:31,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:31,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:40:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759820036] [2022-12-13 13:40:31,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:31,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:40:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:40:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:40:31,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 13:40:31,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 327 transitions, 9727 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:31,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:31,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 13:40:31,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:33,732 INFO L130 PetriNetUnfolder]: 1888/3572 cut-off events. [2022-12-13 13:40:33,733 INFO L131 PetriNetUnfolder]: For 192377/192377 co-relation queries the response was YES. [2022-12-13 13:40:33,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43520 conditions, 3572 events. 1888/3572 cut-off events. For 192377/192377 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24750 event pairs, 489 based on Foata normal form. 1/3563 useless extension candidates. Maximal degree in co-relation 42776. Up to 2874 conditions per place. [2022-12-13 13:40:33,768 INFO L137 encePairwiseOnDemand]: 25/70 looper letters, 256 selfloop transitions, 132 changer transitions 29/417 dead transitions. [2022-12-13 13:40:33,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 417 transitions, 11787 flow [2022-12-13 13:40:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:40:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 13:40:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 190 transitions. [2022-12-13 13:40:33,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15079365079365079 [2022-12-13 13:40:33,770 INFO L175 Difference]: Start difference. First operand has 239 places, 327 transitions, 9727 flow. Second operand 18 states and 190 transitions. [2022-12-13 13:40:33,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 417 transitions, 11787 flow [2022-12-13 13:40:34,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 417 transitions, 11672 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 13:40:34,410 INFO L231 Difference]: Finished difference. Result has 255 places, 342 transitions, 10350 flow [2022-12-13 13:40:34,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=9614, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10350, PETRI_PLACES=255, PETRI_TRANSITIONS=342} [2022-12-13 13:40:34,411 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2022-12-13 13:40:34,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:34,411 INFO L89 Accepts]: Start accepts. Operand has 255 places, 342 transitions, 10350 flow [2022-12-13 13:40:34,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:34,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:34,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 342 transitions, 10350 flow [2022-12-13 13:40:34,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 342 transitions, 10350 flow [2022-12-13 13:40:34,619 INFO L130 PetriNetUnfolder]: 406/1343 cut-off events. [2022-12-13 13:40:34,619 INFO L131 PetriNetUnfolder]: For 82695/83276 co-relation queries the response was YES. [2022-12-13 13:40:34,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16507 conditions, 1343 events. 406/1343 cut-off events. For 82695/83276 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 11880 event pairs, 71 based on Foata normal form. 39/1316 useless extension candidates. Maximal degree in co-relation 16169. Up to 505 conditions per place. [2022-12-13 13:40:34,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 342 transitions, 10350 flow [2022-12-13 13:40:34,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 1060 [2022-12-13 13:40:35,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L49-2-->L49-2: Formula: (let ((.cse5 (select |v_#memory_int_290| v_~f~0.base_190))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_190 (* v_~x2~0_244 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_190 (* 4 .cse2)))) (.cse1 (select .cse5 (+ v_~f~0.offset_190 (* v_~x1~0_309 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_190 (* .cse1 4)))) (.cse4 (select .cse5 (+ v_~f~0.offset_190 (* 4 .cse3)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967295) 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_194) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_244) (< v_~x2~0_244 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_194)) 1 0) 0)) (= (ite (and (< .cse4 v_~size~0_194) (<= 0 .cse4)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_259| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|) (not (= (ite (and (< v_~x1~0_309 v_~size~0_194) (<= 0 v_~x1~0_309)) 1 0) 0)) (= v_~x1~0_307 (select .cse5 (+ v_~f~0.offset_190 (* .cse6 4)))) (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147|) (= |v_thread2Thread1of1ForFork1_~i~1#1_202| (+ |v_thread2Thread1of1ForFork1_~i~1#1_203| 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_202|) 4294967296) .cse0) (= (select .cse5 (+ v_~f~0.offset_190 (* .cse4 4))) v_~x2~0_243) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_203| 4294967296) .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_259| 3) |v_thread1Thread1of1ForFork0_~i~0#1_257|)))))) InVars {~x2~0=v_~x2~0_244, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_190, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_259|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_203|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_309, ~f~0.offset=v_~f~0.offset_190} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_165|, ~x2~0=v_~x2~0_243, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_111|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_190, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_202|, ~x1~0=v_~x1~0_307, ~f~0.offset=v_~f~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_101|, ~n~0=v_~n~0_193, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_173|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_101|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:40:36,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:36,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1997 [2022-12-13 13:40:36,408 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 342 transitions, 10460 flow [2022-12-13 13:40:36,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:36,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:36,408 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:36,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 13:40:36,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:36,608 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash 222025250, now seen corresponding path program 1 times [2022-12-13 13:40:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154706424] [2022-12-13 13:40:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:40:36,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:36,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154706424] [2022-12-13 13:40:36,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154706424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:36,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:36,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:40:36,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430451179] [2022-12-13 13:40:36,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:36,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:40:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:36,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:40:36,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:40:36,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 13:40:36,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 342 transitions, 10460 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:36,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:36,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 13:40:36,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:37,613 INFO L130 PetriNetUnfolder]: 1855/3507 cut-off events. [2022-12-13 13:40:37,614 INFO L131 PetriNetUnfolder]: For 197710/197710 co-relation queries the response was YES. [2022-12-13 13:40:37,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43466 conditions, 3507 events. 1855/3507 cut-off events. For 197710/197710 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24151 event pairs, 667 based on Foata normal form. 36/3533 useless extension candidates. Maximal degree in co-relation 42066. Up to 2711 conditions per place. [2022-12-13 13:40:37,652 INFO L137 encePairwiseOnDemand]: 32/72 looper letters, 249 selfloop transitions, 119 changer transitions 2/370 dead transitions. [2022-12-13 13:40:37,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 370 transitions, 11673 flow [2022-12-13 13:40:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:40:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:40:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 13:40:37,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2022-12-13 13:40:37,653 INFO L175 Difference]: Start difference. First operand has 255 places, 342 transitions, 10460 flow. Second operand 5 states and 104 transitions. [2022-12-13 13:40:37,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 370 transitions, 11673 flow [2022-12-13 13:40:38,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 370 transitions, 11298 flow, removed 95 selfloop flow, removed 6 redundant places. [2022-12-13 13:40:38,323 INFO L231 Difference]: Finished difference. Result has 254 places, 342 transitions, 10317 flow [2022-12-13 13:40:38,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=10085, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10317, PETRI_PLACES=254, PETRI_TRANSITIONS=342} [2022-12-13 13:40:38,324 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 233 predicate places. [2022-12-13 13:40:38,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:38,324 INFO L89 Accepts]: Start accepts. Operand has 254 places, 342 transitions, 10317 flow [2022-12-13 13:40:38,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:38,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:38,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 342 transitions, 10317 flow [2022-12-13 13:40:38,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 342 transitions, 10317 flow [2022-12-13 13:40:38,531 INFO L130 PetriNetUnfolder]: 402/1320 cut-off events. [2022-12-13 13:40:38,532 INFO L131 PetriNetUnfolder]: For 82007/82508 co-relation queries the response was YES. [2022-12-13 13:40:38,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16358 conditions, 1320 events. 402/1320 cut-off events. For 82007/82508 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11619 event pairs, 69 based on Foata normal form. 39/1301 useless extension candidates. Maximal degree in co-relation 15782. Up to 493 conditions per place. [2022-12-13 13:40:38,553 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 342 transitions, 10317 flow [2022-12-13 13:40:38,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 1062 [2022-12-13 13:40:38,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [665] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_297| v_~f~0.base_196))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_196 (* v_~x2~0_263 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_196 (* .cse6 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_196 (* .cse5 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_196 (* .cse3 4)))) (.cse8 (select .cse0 (+ v_~f~0.offset_196 (* v_~x1~0_327 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_196 (* 4 .cse8)))) (.cse2 (* (mod v_~n~0_199 2147483648) 2)) (.cse4 (select .cse0 (+ v_~f~0.offset_196 (* .cse7 4))))) (and (= (select .cse0 (+ v_~f~0.offset_196 (* .cse1 4))) v_~x1~0_325) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_222|) 4294967296) .cse2) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_278| 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_200)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175|) (not (= (ite (and (<= 0 v_~x1~0_327) (< v_~x1~0_327 v_~size~0_200)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_196 (* .cse4 4))) v_~x2~0_262) (= (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_223|) |v_thread2Thread1of1ForFork1_~i~1#1_222|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_200)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_200)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_276| 4294967295) 4294967296) .cse2) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_278| 3) |v_thread1Thread1of1ForFork0_~i~0#1_276|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_200)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_222|) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_200)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175| 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_263) (< v_~x2~0_263 v_~size~0_200)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_223| 4294967296) .cse2) (not (= (ite (and (< .cse8 v_~size~0_200) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_200)) 1 0))))))))) InVars {~x2~0=v_~x2~0_263, ~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_196, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_278|, #memory_int=|v_#memory_int_297|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_223|, ~n~0=v_~n~0_199, ~x1~0=v_~x1~0_327, ~f~0.offset=v_~f~0.offset_196} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_177|, ~x2~0=v_~x2~0_262, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_125|, ~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_196, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_222|, ~x1~0=v_~x1~0_325, ~f~0.offset=v_~f~0.offset_196, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_159|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175|, #memory_int=|v_#memory_int_297|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_115|, ~n~0=v_~n~0_199, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_185|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_115|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:40:40,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:40,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2032 [2022-12-13 13:40:40,356 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 342 transitions, 10377 flow [2022-12-13 13:40:40,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:40,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:40,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:40,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 13:40:40,357 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:40,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1569789508, now seen corresponding path program 1 times [2022-12-13 13:40:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:40,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615044445] [2022-12-13 13:40:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:40,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:48,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615044445] [2022-12-13 13:40:48,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615044445] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:40:48,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893601719] [2022-12-13 13:40:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:48,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:48,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:40:48,088 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:40:48,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:40:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:48,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 13:40:48,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:40:48,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:48,305 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 13:40:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:48,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:48,691 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-13 13:40:48,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-13 13:40:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:49,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893601719] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:49,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:49,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-13 13:40:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651941845] [2022-12-13 13:40:49,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:49,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:40:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:40:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:40:49,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 13:40:49,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 342 transitions, 10377 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:49,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:49,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 13:40:49,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:51,418 INFO L130 PetriNetUnfolder]: 1921/3612 cut-off events. [2022-12-13 13:40:51,418 INFO L131 PetriNetUnfolder]: For 206084/206084 co-relation queries the response was YES. [2022-12-13 13:40:51,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45230 conditions, 3612 events. 1921/3612 cut-off events. For 206084/206084 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 24908 event pairs, 750 based on Foata normal form. 1/3603 useless extension candidates. Maximal degree in co-relation 44648. Up to 2946 conditions per place. [2022-12-13 13:40:51,459 INFO L137 encePairwiseOnDemand]: 27/72 looper letters, 268 selfloop transitions, 140 changer transitions 7/415 dead transitions. [2022-12-13 13:40:51,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 415 transitions, 12367 flow [2022-12-13 13:40:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:40:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:40:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2022-12-13 13:40:51,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19065656565656566 [2022-12-13 13:40:51,460 INFO L175 Difference]: Start difference. First operand has 252 places, 342 transitions, 10377 flow. Second operand 11 states and 151 transitions. [2022-12-13 13:40:51,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 415 transitions, 12367 flow [2022-12-13 13:40:52,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 415 transitions, 12101 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 13:40:52,226 INFO L231 Difference]: Finished difference. Result has 261 places, 369 transitions, 11206 flow [2022-12-13 13:40:52,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=10111, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11206, PETRI_PLACES=261, PETRI_TRANSITIONS=369} [2022-12-13 13:40:52,226 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2022-12-13 13:40:52,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:40:52,227 INFO L89 Accepts]: Start accepts. Operand has 261 places, 369 transitions, 11206 flow [2022-12-13 13:40:52,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:40:52,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:40:52,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 369 transitions, 11206 flow [2022-12-13 13:40:52,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 369 transitions, 11206 flow [2022-12-13 13:40:52,469 INFO L130 PetriNetUnfolder]: 416/1360 cut-off events. [2022-12-13 13:40:52,469 INFO L131 PetriNetUnfolder]: For 85994/86500 co-relation queries the response was YES. [2022-12-13 13:40:52,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17106 conditions, 1360 events. 416/1360 cut-off events. For 85994/86500 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11958 event pairs, 69 based on Foata normal form. 51/1354 useless extension candidates. Maximal degree in co-relation 16831. Up to 511 conditions per place. [2022-12-13 13:40:52,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 369 transitions, 11206 flow [2022-12-13 13:40:52,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 1144 [2022-12-13 13:40:52,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [684] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~f~0.base_226))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_226 (* v_~x2~0_325 4))))) (and (= v_~x2~0_324 (select .cse0 (+ v_~f~0.offset_226 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (= (select .cse0 (+ v_~f~0.offset_226 (* v_~x1~0_382 4))) v_~x1~0_381) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_339| 4294967296) (* (mod v_~n~0_229 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_275|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| (ite (and (<= 0 v_~x1~0_382) (< v_~x1~0_382 v_~size~0_230)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_230)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_338| (+ |v_thread1Thread1of1ForFork0_~i~0#1_339| 1)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_230) (<= 0 v_~x2~0_325)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_339|, #memory_int=|v_#memory_int_330|, ~n~0=v_~n~0_229, ~x1~0=v_~x1~0_382, ~f~0.offset=v_~f~0.offset_226} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_168|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_275|, ~x1~0=v_~x1~0_381, ~f~0.offset=v_~f~0.offset_226, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, #memory_int=|v_#memory_int_330|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_154|, ~n~0=v_~n~0_229, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_154|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:40:52,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 13:40:53,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [683] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_328| v_~f~0.base_224))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_224 (* v_~x2~0_320 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_224 (* .cse3 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_224 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_228) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_224 (* .cse2 4))) v_~x2~0_318) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_228)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_228)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|) (= |v_thread2Thread1of1ForFork1_~i~1#1_271| 4) (not (= (ite (and (< v_~x2~0_320 v_~size~0_228) (<= 0 v_~x2~0_320)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198| 0)) (< 2 (* 2 (mod v_~n~0_227 2147483648)))))))) InVars {~x2~0=v_~x2~0_320, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, #memory_int=|v_#memory_int_328|, ~n~0=v_~n~0_227, ~f~0.offset=v_~f~0.offset_224} OutVars{~x2~0=v_~x2~0_318, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_160|, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_164|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_271|, ~f~0.offset=v_~f~0.offset_224, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|, #memory_int=|v_#memory_int_328|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_150|, ~n~0=v_~n~0_227, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_150|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:40:53,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:40:53,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1104 [2022-12-13 13:40:53,332 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 368 transitions, 11309 flow [2022-12-13 13:40:53,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:53,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:53,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:53,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 13:40:53,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:40:53,532 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:40:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -269588529, now seen corresponding path program 1 times [2022-12-13 13:40:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698272415] [2022-12-13 13:40:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:47:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:52,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698272415] [2022-12-13 13:47:52,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698272415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:47:52,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133327167] [2022-12-13 13:47:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:47:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:47:52,453 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:47:52,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 13:47:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:52,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 13:47:52,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:47:52,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:47:52,622 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 76 [2022-12-13 13:47:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:47:52,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:47:52,975 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-13 13:47:52,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-13 13:47:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:47:53,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133327167] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:47:53,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:47:53,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 13:47:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058407437] [2022-12-13 13:47:53,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:47:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:47:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:47:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:47:53,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 13:47:53,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 368 transitions, 11309 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:53,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:53,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 13:47:53,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:55,193 INFO L130 PetriNetUnfolder]: 1941/3645 cut-off events. [2022-12-13 13:47:55,193 INFO L131 PetriNetUnfolder]: For 216598/216598 co-relation queries the response was YES. [2022-12-13 13:47:55,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46345 conditions, 3645 events. 1941/3645 cut-off events. For 216598/216598 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25222 event pairs, 877 based on Foata normal form. 1/3636 useless extension candidates. Maximal degree in co-relation 45639. Up to 3475 conditions per place. [2022-12-13 13:47:55,235 INFO L137 encePairwiseOnDemand]: 41/76 looper letters, 318 selfloop transitions, 70 changer transitions 1/389 dead transitions. [2022-12-13 13:47:55,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 389 transitions, 12439 flow [2022-12-13 13:47:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:47:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:47:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-13 13:47:55,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20676691729323307 [2022-12-13 13:47:55,236 INFO L175 Difference]: Start difference. First operand has 260 places, 368 transitions, 11309 flow. Second operand 7 states and 110 transitions. [2022-12-13 13:47:55,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 389 transitions, 12439 flow [2022-12-13 13:47:56,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 389 transitions, 12093 flow, removed 130 selfloop flow, removed 3 redundant places. [2022-12-13 13:47:56,059 INFO L231 Difference]: Finished difference. Result has 265 places, 373 transitions, 11356 flow [2022-12-13 13:47:56,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=10963, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11356, PETRI_PLACES=265, PETRI_TRANSITIONS=373} [2022-12-13 13:47:56,060 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 244 predicate places. [2022-12-13 13:47:56,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:47:56,060 INFO L89 Accepts]: Start accepts. Operand has 265 places, 373 transitions, 11356 flow [2022-12-13 13:47:56,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:47:56,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:47:56,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 373 transitions, 11356 flow [2022-12-13 13:47:56,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 373 transitions, 11356 flow [2022-12-13 13:47:56,287 INFO L130 PetriNetUnfolder]: 423/1377 cut-off events. [2022-12-13 13:47:56,287 INFO L131 PetriNetUnfolder]: For 89392/89936 co-relation queries the response was YES. [2022-12-13 13:47:56,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17345 conditions, 1377 events. 423/1377 cut-off events. For 89392/89936 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 12144 event pairs, 68 based on Foata normal form. 41/1359 useless extension candidates. Maximal degree in co-relation 17019. Up to 516 conditions per place. [2022-12-13 13:47:56,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 373 transitions, 11356 flow [2022-12-13 13:47:56,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 13:47:56,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_356| v_~f~0.base_244))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_244 (* v_~x2~0_364 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_244 (* .cse5 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_244 (* v_~x1~0_445 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_244 (* .cse2 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_244 (* .cse4 4))))) (and (= (select .cse0 (+ v_~f~0.offset_244 (* 4 .cse1))) v_~x2~0_363) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_248)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_226| 0)) (= (select .cse0 (+ v_~f~0.offset_244 (* .cse3 4))) v_~x1~0_444) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249| 0)) (not (= (ite (and (< .cse4 v_~size~0_248) (<= 0 .cse4)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_445) (< v_~x1~0_445 v_~size~0_248)) 1 0))) (= |v_thread2Thread1of1ForFork1_~i~1#1_309| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233| (ite (and (< .cse3 v_~size~0_248) (<= 0 .cse3)) 1 0)) (< 2 (* (mod v_~n~0_247 2147483648) 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_226|) (not (= (ite (and (< .cse5 v_~size~0_248) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_364 v_~size~0_248) (<= 0 v_~x2~0_364)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|) (= |v_thread1Thread1of1ForFork0_~i~0#1_389| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_248)) 1 0))))))) InVars {~x2~0=v_~x2~0_364, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_244, #memory_int=|v_#memory_int_356|, ~n~0=v_~n~0_247, ~x1~0=v_~x1~0_445, ~f~0.offset=v_~f~0.offset_244} OutVars{~x2~0=v_~x2~0_363, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_251|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_188|, ~size~0=v_~size~0_248, ~f~0.base=v_~f~0.base_244, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_192|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_309|, ~x1~0=v_~x1~0_444, ~f~0.offset=v_~f~0.offset_244, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_226|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_389|, #memory_int=|v_#memory_int_356|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_178|, ~n~0=v_~n~0_247, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_178|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_259|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:47:57,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:47:57,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1097 [2022-12-13 13:47:57,157 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 373 transitions, 11432 flow [2022-12-13 13:47:57,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:47:57,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:57,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:57,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 13:47:57,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:47:57,358 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:47:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1007178372, now seen corresponding path program 1 times [2022-12-13 13:47:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:57,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149544967] [2022-12-13 13:47:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:47:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149544967] [2022-12-13 13:47:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149544967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:47:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807408030] [2022-12-13 13:47:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:58,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:47:58,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:47:58,539 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:47:58,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 13:47:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:58,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 13:47:58,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:47:58,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:47:58,672 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 30 treesize of output 28 [2022-12-13 13:47:58,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:47:58,727 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 13:47:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:47:58,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:47:58,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:47:58,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 13:47:58,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:47:58,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 13:48:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:01,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807408030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:48:01,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:48:01,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:48:01,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881979244] [2022-12-13 13:48:01,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:48:01,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:48:01,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:01,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:48:01,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:48:01,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 13:48:01,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 373 transitions, 11432 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:01,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:01,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 13:48:01,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:03,467 INFO L130 PetriNetUnfolder]: 1985/3727 cut-off events. [2022-12-13 13:48:03,467 INFO L131 PetriNetUnfolder]: For 225783/225783 co-relation queries the response was YES. [2022-12-13 13:48:03,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47404 conditions, 3727 events. 1985/3727 cut-off events. For 225783/225783 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 25845 event pairs, 485 based on Foata normal form. 1/3718 useless extension candidates. Maximal degree in co-relation 46829. Up to 2960 conditions per place. [2022-12-13 13:48:03,505 INFO L137 encePairwiseOnDemand]: 26/78 looper letters, 267 selfloop transitions, 156 changer transitions 8/431 dead transitions. [2022-12-13 13:48:03,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 431 transitions, 13226 flow [2022-12-13 13:48:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:48:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:48:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2022-12-13 13:48:03,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2022-12-13 13:48:03,506 INFO L175 Difference]: Start difference. First operand has 265 places, 373 transitions, 11432 flow. Second operand 11 states and 156 transitions. [2022-12-13 13:48:03,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 431 transitions, 13226 flow [2022-12-13 13:48:04,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 431 transitions, 13110 flow, removed 52 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:04,232 INFO L231 Difference]: Finished difference. Result has 278 places, 385 transitions, 12169 flow [2022-12-13 13:48:04,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=11326, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12169, PETRI_PLACES=278, PETRI_TRANSITIONS=385} [2022-12-13 13:48:04,232 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 257 predicate places. [2022-12-13 13:48:04,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:04,232 INFO L89 Accepts]: Start accepts. Operand has 278 places, 385 transitions, 12169 flow [2022-12-13 13:48:04,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:04,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:04,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 385 transitions, 12169 flow [2022-12-13 13:48:04,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 385 transitions, 12169 flow [2022-12-13 13:48:04,445 INFO L130 PetriNetUnfolder]: 433/1415 cut-off events. [2022-12-13 13:48:04,446 INFO L131 PetriNetUnfolder]: For 95531/96055 co-relation queries the response was YES. [2022-12-13 13:48:04,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18145 conditions, 1415 events. 433/1415 cut-off events. For 95531/96055 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 12558 event pairs, 67 based on Foata normal form. 35/1391 useless extension candidates. Maximal degree in co-relation 17863. Up to 527 conditions per place. [2022-12-13 13:48:04,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 385 transitions, 12169 flow [2022-12-13 13:48:04,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-13 13:48:04,467 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:48:04,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-13 13:48:04,468 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 385 transitions, 12169 flow [2022-12-13 13:48:04,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:04,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:04,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:04,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 13:48:04,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 13:48:04,673 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:48:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1557141805, now seen corresponding path program 1 times [2022-12-13 13:48:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:04,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468596921] [2022-12-13 13:48:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:29,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468596921] [2022-12-13 13:48:29,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468596921] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:48:29,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589532455] [2022-12-13 13:48:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:29,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:48:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:48:29,709 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:48:29,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 13:48:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:29,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 13:48:29,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:29,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:48:29,859 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 30 treesize of output 28 [2022-12-13 13:48:29,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:48:29,917 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 76 [2022-12-13 13:48:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:29,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:48:30,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:48:30,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 13:48:30,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:48:30,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 152 [2022-12-13 13:48:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:32,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589532455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:48:32,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:48:32,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:48:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757801486] [2022-12-13 13:48:32,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:48:32,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:48:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:32,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:48:32,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:48:32,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 13:48:32,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 385 transitions, 12169 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:32,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:32,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 13:48:32,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:34,300 INFO L130 PetriNetUnfolder]: 2041/3824 cut-off events. [2022-12-13 13:48:34,301 INFO L131 PetriNetUnfolder]: For 237311/237311 co-relation queries the response was YES. [2022-12-13 13:48:34,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49707 conditions, 3824 events. 2041/3824 cut-off events. For 237311/237311 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 26813 event pairs, 639 based on Foata normal form. 1/3815 useless extension candidates. Maximal degree in co-relation 48710. Up to 3546 conditions per place. [2022-12-13 13:48:34,346 INFO L137 encePairwiseOnDemand]: 35/78 looper letters, 325 selfloop transitions, 101 changer transitions 2/428 dead transitions. [2022-12-13 13:48:34,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 428 transitions, 13877 flow [2022-12-13 13:48:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:48:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:48:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-12-13 13:48:34,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17051282051282052 [2022-12-13 13:48:34,349 INFO L175 Difference]: Start difference. First operand has 278 places, 385 transitions, 12169 flow. Second operand 10 states and 133 transitions. [2022-12-13 13:48:34,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 428 transitions, 13877 flow [2022-12-13 13:48:35,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 428 transitions, 13731 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-13 13:48:35,259 INFO L231 Difference]: Finished difference. Result has 287 places, 402 transitions, 12904 flow [2022-12-13 13:48:35,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=12027, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12904, PETRI_PLACES=287, PETRI_TRANSITIONS=402} [2022-12-13 13:48:35,269 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 266 predicate places. [2022-12-13 13:48:35,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:35,269 INFO L89 Accepts]: Start accepts. Operand has 287 places, 402 transitions, 12904 flow [2022-12-13 13:48:35,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:35,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:35,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 402 transitions, 12904 flow [2022-12-13 13:48:35,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 402 transitions, 12904 flow [2022-12-13 13:48:35,550 INFO L130 PetriNetUnfolder]: 444/1438 cut-off events. [2022-12-13 13:48:35,550 INFO L131 PetriNetUnfolder]: For 98277/98799 co-relation queries the response was YES. [2022-12-13 13:48:35,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18833 conditions, 1438 events. 444/1438 cut-off events. For 98277/98799 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12839 event pairs, 74 based on Foata normal form. 36/1414 useless extension candidates. Maximal degree in co-relation 18390. Up to 548 conditions per place. [2022-12-13 13:48:35,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 402 transitions, 12904 flow [2022-12-13 13:48:35,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 1250 [2022-12-13 13:48:35,574 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:48:35,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-13 13:48:35,576 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 402 transitions, 12904 flow [2022-12-13 13:48:35,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:35,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:35,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:35,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 13:48:35,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 13:48:35,781 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:48:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2085322227, now seen corresponding path program 1 times [2022-12-13 13:48:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:35,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713080534] [2022-12-13 13:48:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:35,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:35,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713080534] [2022-12-13 13:48:35,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713080534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:35,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:35,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:48:35,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799693367] [2022-12-13 13:48:35,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:35,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:48:35,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:35,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:48:35,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:48:35,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 13:48:35,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 402 transitions, 12904 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:35,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:35,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 13:48:35,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:37,114 INFO L130 PetriNetUnfolder]: 2071/3886 cut-off events. [2022-12-13 13:48:37,114 INFO L131 PetriNetUnfolder]: For 251339/251339 co-relation queries the response was YES. [2022-12-13 13:48:37,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51077 conditions, 3886 events. 2071/3886 cut-off events. For 251339/251339 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27258 event pairs, 923 based on Foata normal form. 8/3884 useless extension candidates. Maximal degree in co-relation 49919. Up to 3554 conditions per place. [2022-12-13 13:48:37,156 INFO L137 encePairwiseOnDemand]: 49/78 looper letters, 344 selfloop transitions, 81 changer transitions 1/426 dead transitions. [2022-12-13 13:48:37,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 426 transitions, 14247 flow [2022-12-13 13:48:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:48:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:48:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 13:48:37,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2717948717948718 [2022-12-13 13:48:37,157 INFO L175 Difference]: Start difference. First operand has 287 places, 402 transitions, 12904 flow. Second operand 5 states and 106 transitions. [2022-12-13 13:48:37,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 426 transitions, 14247 flow [2022-12-13 13:48:37,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 426 transitions, 13990 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-12-13 13:48:37,983 INFO L231 Difference]: Finished difference. Result has 288 places, 406 transitions, 12964 flow [2022-12-13 13:48:37,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=12651, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12964, PETRI_PLACES=288, PETRI_TRANSITIONS=406} [2022-12-13 13:48:37,984 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 267 predicate places. [2022-12-13 13:48:37,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:37,984 INFO L89 Accepts]: Start accepts. Operand has 288 places, 406 transitions, 12964 flow [2022-12-13 13:48:37,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:37,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:37,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 406 transitions, 12964 flow [2022-12-13 13:48:37,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 406 transitions, 12964 flow [2022-12-13 13:48:38,222 INFO L130 PetriNetUnfolder]: 450/1462 cut-off events. [2022-12-13 13:48:38,223 INFO L131 PetriNetUnfolder]: For 105362/105923 co-relation queries the response was YES. [2022-12-13 13:48:38,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19398 conditions, 1462 events. 450/1462 cut-off events. For 105362/105923 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13046 event pairs, 72 based on Foata normal form. 41/1441 useless extension candidates. Maximal degree in co-relation 18978. Up to 558 conditions per place. [2022-12-13 13:48:38,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 406 transitions, 12964 flow [2022-12-13 13:48:38,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 1262 [2022-12-13 13:48:38,248 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:48:38,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 264 [2022-12-13 13:48:38,248 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 406 transitions, 12964 flow [2022-12-13 13:48:38,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:38,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:38,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:38,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 13:48:38,249 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:48:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:38,249 INFO L85 PathProgramCache]: Analyzing trace with hash -595417083, now seen corresponding path program 1 times [2022-12-13 13:48:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:38,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785530696] [2022-12-13 13:48:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:38,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785530696] [2022-12-13 13:48:38,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785530696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:48:38,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867650542] [2022-12-13 13:48:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:38,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:48:38,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:48:38,306 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:48:38,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 13:48:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:38,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:48:38,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:38,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:48:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:38,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867650542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:48:38,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:48:38,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 13:48:38,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267761711] [2022-12-13 13:48:38,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:48:38,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:48:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:48:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:48:38,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 13:48:38,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 406 transitions, 12964 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:38,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:38,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 13:48:38,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:39,846 INFO L130 PetriNetUnfolder]: 2125/4000 cut-off events. [2022-12-13 13:48:39,846 INFO L131 PetriNetUnfolder]: For 267122/267122 co-relation queries the response was YES. [2022-12-13 13:48:39,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53141 conditions, 4000 events. 2125/4000 cut-off events. For 267122/267122 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 28296 event pairs, 948 based on Foata normal form. 18/4008 useless extension candidates. Maximal degree in co-relation 52364. Up to 3712 conditions per place. [2022-12-13 13:48:39,893 INFO L137 encePairwiseOnDemand]: 58/78 looper letters, 393 selfloop transitions, 48 changer transitions 2/443 dead transitions. [2022-12-13 13:48:39,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 443 transitions, 14637 flow [2022-12-13 13:48:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:48:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:48:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-13 13:48:39,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 13:48:39,894 INFO L175 Difference]: Start difference. First operand has 288 places, 406 transitions, 12964 flow. Second operand 6 states and 117 transitions. [2022-12-13 13:48:39,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 443 transitions, 14637 flow [2022-12-13 13:48:40,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 443 transitions, 14495 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 13:48:40,762 INFO L231 Difference]: Finished difference. Result has 291 places, 412 transitions, 13203 flow [2022-12-13 13:48:40,762 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=12830, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13203, PETRI_PLACES=291, PETRI_TRANSITIONS=412} [2022-12-13 13:48:40,762 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 270 predicate places. [2022-12-13 13:48:40,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:40,762 INFO L89 Accepts]: Start accepts. Operand has 291 places, 412 transitions, 13203 flow [2022-12-13 13:48:40,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:40,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:40,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 412 transitions, 13203 flow [2022-12-13 13:48:40,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 412 transitions, 13203 flow [2022-12-13 13:48:41,073 INFO L130 PetriNetUnfolder]: 460/1514 cut-off events. [2022-12-13 13:48:41,074 INFO L131 PetriNetUnfolder]: For 109637/110193 co-relation queries the response was YES. [2022-12-13 13:48:41,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20249 conditions, 1514 events. 460/1514 cut-off events. For 109637/110193 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 13754 event pairs, 72 based on Foata normal form. 41/1493 useless extension candidates. Maximal degree in co-relation 19888. Up to 573 conditions per place. [2022-12-13 13:48:41,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 412 transitions, 13203 flow [2022-12-13 13:48:41,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 1300 [2022-12-13 13:48:41,117 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:48:41,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-13 13:48:41,118 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 412 transitions, 13203 flow [2022-12-13 13:48:41,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:41,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:41,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:41,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 13:48:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 13:48:41,323 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:48:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1404763709, now seen corresponding path program 1 times [2022-12-13 13:48:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041705215] [2022-12-13 13:48:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:41,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041705215] [2022-12-13 13:48:41,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041705215] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:48:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465678365] [2022-12-13 13:48:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:41,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:48:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:48:41,444 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:48:41,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 13:48:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:41,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:48:41,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:41,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:48:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:41,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465678365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:48:41,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:48:41,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 13:48:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174544169] [2022-12-13 13:48:41,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:48:41,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:48:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:41,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:48:41,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:48:41,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 13:48:41,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 412 transitions, 13203 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:41,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:41,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 13:48:41,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:43,337 INFO L130 PetriNetUnfolder]: 2149/4040 cut-off events. [2022-12-13 13:48:43,337 INFO L131 PetriNetUnfolder]: For 282079/282079 co-relation queries the response was YES. [2022-12-13 13:48:43,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54746 conditions, 4040 events. 2149/4040 cut-off events. For 282079/282079 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 28619 event pairs, 1007 based on Foata normal form. 12/4042 useless extension candidates. Maximal degree in co-relation 53957. Up to 3902 conditions per place. [2022-12-13 13:48:43,388 INFO L137 encePairwiseOnDemand]: 62/78 looper letters, 393 selfloop transitions, 46 changer transitions 0/439 dead transitions. [2022-12-13 13:48:43,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 439 transitions, 14878 flow [2022-12-13 13:48:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:48:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:48:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-13 13:48:43,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17147435897435898 [2022-12-13 13:48:43,390 INFO L175 Difference]: Start difference. First operand has 291 places, 412 transitions, 13203 flow. Second operand 8 states and 107 transitions. [2022-12-13 13:48:43,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 439 transitions, 14878 flow [2022-12-13 13:48:44,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 439 transitions, 14780 flow, removed 49 selfloop flow, removed 0 redundant places. [2022-12-13 13:48:44,307 INFO L231 Difference]: Finished difference. Result has 302 places, 419 transitions, 13544 flow [2022-12-13 13:48:44,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=13105, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13544, PETRI_PLACES=302, PETRI_TRANSITIONS=419} [2022-12-13 13:48:44,307 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 281 predicate places. [2022-12-13 13:48:44,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:44,307 INFO L89 Accepts]: Start accepts. Operand has 302 places, 419 transitions, 13544 flow [2022-12-13 13:48:44,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:44,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:44,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 419 transitions, 13544 flow [2022-12-13 13:48:44,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 419 transitions, 13544 flow [2022-12-13 13:48:44,631 INFO L130 PetriNetUnfolder]: 465/1526 cut-off events. [2022-12-13 13:48:44,631 INFO L131 PetriNetUnfolder]: For 124257/124823 co-relation queries the response was YES. [2022-12-13 13:48:44,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21095 conditions, 1526 events. 465/1526 cut-off events. For 124257/124823 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13835 event pairs, 72 based on Foata normal form. 46/1512 useless extension candidates. Maximal degree in co-relation 20729. Up to 580 conditions per place. [2022-12-13 13:48:44,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 419 transitions, 13544 flow [2022-12-13 13:48:44,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 13:48:45,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_361| v_~f~0.base_248))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_248 (* v_~x2~0_375 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_248 (* .cse6 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_248 (* .cse2 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_248 (* 4 .cse7)))) (.cse5 (select .cse0 (+ (* v_~x1~0_459 4) v_~f~0.offset_248)))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_248 (* .cse5 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_248 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_232|) (= (select .cse0 (+ v_~f~0.offset_248 (* .cse1 4))) v_~x1~0_458) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_315|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_258| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_258|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_252)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_232| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_252)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_398| 3) (= (ite (and (< .cse1 v_~size~0_252) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|) (= v_~x2~0_373 (select .cse0 (+ v_~f~0.offset_248 (* .cse4 4)))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_252) (<= 0 .cse7)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_315|) 4294967296) (* 2 (mod v_~n~0_251 2147483648))) (not (= (ite (and (<= 0 v_~x1~0_459) (< v_~x1~0_459 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_375) (< v_~x2~0_375 v_~size~0_252)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (and (< .cse4 v_~size~0_252) (<= 0 .cse4)) 1 0))))))))) InVars {~x2~0=v_~x2~0_375, ~size~0=v_~size~0_252, ~f~0.base=v_~f~0.base_248, #memory_int=|v_#memory_int_361|, ~n~0=v_~n~0_251, ~x1~0=v_~x1~0_459, ~f~0.offset=v_~f~0.offset_248} OutVars{~x2~0=v_~x2~0_373, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_260|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_194|, ~size~0=v_~size~0_252, ~f~0.base=v_~f~0.base_248, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_198|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_315|, ~x1~0=v_~x1~0_458, ~f~0.offset=v_~f~0.offset_248, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_232|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_398|, #memory_int=|v_#memory_int_361|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_258|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_184|, ~n~0=v_~n~0_251, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_184|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_268|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:48:45,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:48:45,900 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:48:45,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1593 [2022-12-13 13:48:45,901 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 419 transitions, 13686 flow [2022-12-13 13:48:45,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:45,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:45,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:45,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 13:48:46,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:48:46,107 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:48:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1067515363, now seen corresponding path program 2 times [2022-12-13 13:48:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:46,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519678751] [2022-12-13 13:48:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:46,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:46,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519678751] [2022-12-13 13:48:46,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519678751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:46,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:46,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:48:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277536026] [2022-12-13 13:48:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:46,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:48:46,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:48:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:48:46,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-13 13:48:46,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 419 transitions, 13686 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:46,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:46,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-13 13:48:46,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:47,475 INFO L130 PetriNetUnfolder]: 2135/4008 cut-off events. [2022-12-13 13:48:47,475 INFO L131 PetriNetUnfolder]: For 304094/304094 co-relation queries the response was YES. [2022-12-13 13:48:47,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55590 conditions, 4008 events. 2135/4008 cut-off events. For 304094/304094 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 28266 event pairs, 1027 based on Foata normal form. 6/4004 useless extension candidates. Maximal degree in co-relation 54796. Up to 3988 conditions per place. [2022-12-13 13:48:47,524 INFO L137 encePairwiseOnDemand]: 77/82 looper letters, 417 selfloop transitions, 3 changer transitions 8/428 dead transitions. [2022-12-13 13:48:47,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 428 transitions, 14724 flow [2022-12-13 13:48:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:48:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:48:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 13:48:47,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2896341463414634 [2022-12-13 13:48:47,525 INFO L175 Difference]: Start difference. First operand has 302 places, 419 transitions, 13686 flow. Second operand 4 states and 95 transitions. [2022-12-13 13:48:47,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 428 transitions, 14724 flow [2022-12-13 13:48:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 428 transitions, 14395 flow, removed 144 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:48,529 INFO L231 Difference]: Finished difference. Result has 305 places, 419 transitions, 13370 flow [2022-12-13 13:48:48,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=13357, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13370, PETRI_PLACES=305, PETRI_TRANSITIONS=419} [2022-12-13 13:48:48,529 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 284 predicate places. [2022-12-13 13:48:48,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:48,529 INFO L89 Accepts]: Start accepts. Operand has 305 places, 419 transitions, 13370 flow [2022-12-13 13:48:48,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:48,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:48,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 419 transitions, 13370 flow [2022-12-13 13:48:48,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 419 transitions, 13370 flow [2022-12-13 13:48:48,783 INFO L130 PetriNetUnfolder]: 462/1508 cut-off events. [2022-12-13 13:48:48,783 INFO L131 PetriNetUnfolder]: For 127032/127666 co-relation queries the response was YES. [2022-12-13 13:48:48,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21084 conditions, 1508 events. 462/1508 cut-off events. For 127032/127666 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 13604 event pairs, 71 based on Foata normal form. 45/1494 useless extension candidates. Maximal degree in co-relation 20747. Up to 571 conditions per place. [2022-12-13 13:48:48,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 419 transitions, 13370 flow [2022-12-13 13:48:48,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 1316 [2022-12-13 13:48:48,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_359| v_~f~0.base_246))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_246 (* v_~x2~0_370 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_246 (* v_~x1~0_454 4))))) (let ((.cse6 (select .cse0 (+ (* .cse3 4) v_~f~0.offset_246))) (.cse5 (select .cse0 (+ v_~f~0.offset_246 (* .cse4 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_246 (* .cse5 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_246 (* .cse6 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_394| 4) (= (select .cse0 (+ v_~f~0.offset_246 (* .cse1 4))) v_~x2~0_369) (= v_~x1~0_452 (select .cse0 (+ v_~f~0.offset_246 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_250)) 1 0)) (= (ite (and (< .cse2 v_~size~0_250) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_250)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254| 0)) (< 3 (* 2 (mod v_~n~0_249 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|) (not (= (ite (and (< .cse4 v_~size~0_250) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_250)) 1 0) 0)) (not (= 0 (ite (and (< v_~x2~0_370 v_~size~0_250) (<= 0 v_~x2~0_370)) 1 0))) (not (= (ite (and (<= 0 v_~x1~0_454) (< v_~x1~0_454 v_~size~0_250)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_250) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254|) (= |v_thread2Thread1of1ForFork1_~i~1#1_313| 4)))))) InVars {~x2~0=v_~x2~0_370, ~size~0=v_~size~0_250, ~f~0.base=v_~f~0.base_246, #memory_int=|v_#memory_int_359|, ~n~0=v_~n~0_249, ~x1~0=v_~x1~0_454, ~f~0.offset=v_~f~0.offset_246} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_256|, ~x2~0=v_~x2~0_369, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_192|, ~size~0=v_~size~0_250, ~f~0.base=v_~f~0.base_246, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_196|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_313|, ~x1~0=v_~x1~0_452, ~f~0.offset=v_~f~0.offset_246, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_394|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254|, #memory_int=|v_#memory_int_359|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_182|, ~n~0=v_~n~0_249, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_264|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_182|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:48:49,824 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:48:49,825 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1296 [2022-12-13 13:48:49,825 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 419 transitions, 13448 flow [2022-12-13 13:48:49,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:49,825 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:49,825 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:49,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 13:48:49,825 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:48:49,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:49,826 INFO L85 PathProgramCache]: Analyzing trace with hash -407022579, now seen corresponding path program 1 times [2022-12-13 13:48:49,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:49,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499476505] [2022-12-13 13:48:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:50,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499476505] [2022-12-13 13:48:50,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499476505] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:48:50,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456224944] [2022-12-13 13:48:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:50,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:48:50,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:48:50,903 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:48:50,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 13:48:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:51,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:48:51,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:51,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:48:51,063 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 30 treesize of output 28 [2022-12-13 13:48:51,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:48:51,120 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 13:48:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:51,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:48:51,185 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1546) c_~f~0.base))) (= (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4))) 4)))))) is different from false [2022-12-13 13:48:51,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:48:51,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 13:48:51,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:48:51,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 13:48:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:54,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456224944] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:48:54,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:48:54,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:48:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453176991] [2022-12-13 13:48:54,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:48:54,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:48:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:54,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:48:54,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2022-12-13 13:48:54,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 13:48:54,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 419 transitions, 13448 flow. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:48:54,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:54,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 13:48:54,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:57,367 INFO L130 PetriNetUnfolder]: 2159/4044 cut-off events. [2022-12-13 13:48:57,367 INFO L131 PetriNetUnfolder]: For 323942/323942 co-relation queries the response was YES. [2022-12-13 13:48:57,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56912 conditions, 4044 events. 2159/4044 cut-off events. For 323942/323942 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 28496 event pairs, 908 based on Foata normal form. 1/4035 useless extension candidates. Maximal degree in co-relation 56110. Up to 3740 conditions per place. [2022-12-13 13:48:57,420 INFO L137 encePairwiseOnDemand]: 37/84 looper letters, 349 selfloop transitions, 112 changer transitions 3/464 dead transitions. [2022-12-13 13:48:57,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 464 transitions, 15187 flow [2022-12-13 13:48:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:48:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:48:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2022-12-13 13:48:57,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13690476190476192 [2022-12-13 13:48:57,423 INFO L175 Difference]: Start difference. First operand has 304 places, 419 transitions, 13448 flow. Second operand 14 states and 161 transitions. [2022-12-13 13:48:57,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 464 transitions, 15187 flow [2022-12-13 13:48:58,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 464 transitions, 15150 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:58,773 INFO L231 Difference]: Finished difference. Result has 318 places, 427 transitions, 14098 flow [2022-12-13 13:48:58,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=13411, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14098, PETRI_PLACES=318, PETRI_TRANSITIONS=427} [2022-12-13 13:48:58,782 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 297 predicate places. [2022-12-13 13:48:58,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:48:58,782 INFO L89 Accepts]: Start accepts. Operand has 318 places, 427 transitions, 14098 flow [2022-12-13 13:48:58,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:48:58,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:48:58,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 427 transitions, 14098 flow [2022-12-13 13:48:58,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 316 places, 427 transitions, 14098 flow [2022-12-13 13:48:59,053 INFO L130 PetriNetUnfolder]: 470/1527 cut-off events. [2022-12-13 13:48:59,053 INFO L131 PetriNetUnfolder]: For 134047/134691 co-relation queries the response was YES. [2022-12-13 13:48:59,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21812 conditions, 1527 events. 470/1527 cut-off events. For 134047/134691 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13806 event pairs, 72 based on Foata normal form. 45/1513 useless extension candidates. Maximal degree in co-relation 21440. Up to 580 conditions per place. [2022-12-13 13:48:59,096 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 316 places, 427 transitions, 14098 flow [2022-12-13 13:48:59,096 INFO L226 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-13 13:48:59,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:48:59,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_181| v_~f~0.base_110))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_110 (* v_~x1~0_162 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_110 (* v_~x2~0_120 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= (ite (and (< v_~x2~0_120 v_~size~0_122) (<= 0 v_~x2~0_120)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_162) (< v_~x1~0_162 v_~size~0_122)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_136| 2) (< 1 (* 2 (mod v_~n~0_121 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_97|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_122)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= (select .cse1 (+ v_~f~0.offset_110 (* .cse2 4))) v_~x2~0_119) (= v_~x1~0_160 (select .cse1 (+ v_~f~0.offset_110 (* .cse0 4)))) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_122)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0))))) InVars {~x2~0=v_~x2~0_120, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, #memory_int=|v_#memory_int_181|, ~n~0=v_~n~0_121, ~x1~0=v_~x1~0_162, ~f~0.offset=v_~f~0.offset_110} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_88|, ~x2~0=v_~x2~0_119, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_48|, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_97|, ~x1~0=v_~x1~0_160, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86|, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_38|, ~n~0=v_~n~0_121, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_96|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [643] L59-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_251| v_~f~0.base_160))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_160 (* v_~x2~0_189 4)))) (.cse2 (* (mod v_~n~0_165 2147483648) 2))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (= v_~x2~0_188 (select .cse0 (+ v_~f~0.offset_160 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_151|) |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_166)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= v_~x1~0_239 (select .cse0 (+ v_~f~0.offset_160 (* v_~x1~0_240 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| (+ |v_thread1Thread1of1ForFork0_~i~0#1_196| 1)) (not (= (ite (and (< v_~x2~0_189 v_~size~0_166) (<= 0 v_~x2~0_189)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| (ite (and (<= 0 v_~x1~0_240) (< v_~x1~0_240 v_~size~0_166)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_151| 4294967296) .cse2) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_196| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|)))) InVars {~x2~0=v_~x2~0_189, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_196|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_151|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_160} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_127|, ~x2~0=v_~x2~0_188, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_85|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~x1~0=v_~x1~0_239, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_71|, ~n~0=v_~n~0_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:00,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-13 13:49:00,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [683] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_328| v_~f~0.base_224))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_224 (* v_~x2~0_320 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_224 (* .cse3 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_224 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_228) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_224 (* .cse2 4))) v_~x2~0_318) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_228)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_228)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|) (= |v_thread2Thread1of1ForFork1_~i~1#1_271| 4) (not (= (ite (and (< v_~x2~0_320 v_~size~0_228) (<= 0 v_~x2~0_320)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198| 0)) (< 2 (* 2 (mod v_~n~0_227 2147483648)))))))) InVars {~x2~0=v_~x2~0_320, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, #memory_int=|v_#memory_int_328|, ~n~0=v_~n~0_227, ~f~0.offset=v_~f~0.offset_224} OutVars{~x2~0=v_~x2~0_318, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_160|, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_224, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_164|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_174|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_271|, ~f~0.offset=v_~f~0.offset_224, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|, #memory_int=|v_#memory_int_328|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_150|, ~n~0=v_~n~0_227, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_150|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:00,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [684] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_330| v_~f~0.base_226))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_226 (* v_~x2~0_325 4))))) (and (= v_~x2~0_324 (select .cse0 (+ v_~f~0.offset_226 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (= (select .cse0 (+ v_~f~0.offset_226 (* v_~x1~0_382 4))) v_~x1~0_381) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_339| 4294967296) (* (mod v_~n~0_229 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_275|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| (ite (and (<= 0 v_~x1~0_382) (< v_~x1~0_382 v_~size~0_230)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_230)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_338| (+ |v_thread1Thread1of1ForFork0_~i~0#1_339| 1)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_230) (<= 0 v_~x2~0_325)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_339|, #memory_int=|v_#memory_int_330|, ~n~0=v_~n~0_229, ~x1~0=v_~x1~0_382, ~f~0.offset=v_~f~0.offset_226} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_226, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_168|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_178|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_275|, ~x1~0=v_~x1~0_381, ~f~0.offset=v_~f~0.offset_226, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, #memory_int=|v_#memory_int_330|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_154|, ~n~0=v_~n~0_229, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_154|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:00,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] $Ultimate##0-->L83-3: Formula: (let ((.cse0 (select |v_#memory_int_353| v_~f~0.base_242))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_242 (* v_~x1~0_441 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_242 (* .cse2 4))))) (and (= (select .cse0 (+ v_~f~0.offset_242 (* .cse1 4))) v_~x1~0_440) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_387| 4294967295) 4294967296) (* (mod v_~n~0_245 2147483648) 2)) (= (store |v_#memory_int_353| |v_ULTIMATE.start_main_~#t2~0#1.base_67| (store (select |v_#memory_int_353| |v_ULTIMATE.start_main_~#t2~0#1.base_67|) |v_ULTIMATE.start_main_~#t2~0#1.offset_67| |v_ULTIMATE.start_main_#t~pre12#1_96|)) |v_#memory_int_352|) (= |v_ULTIMATE.start_main_#t~pre12#1_96| |v_#pthreadsForks_106|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_246)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247| 0)) (= (+ |v_#pthreadsForks_106| 1) |v_#pthreadsForks_105|) (= |v_thread1Thread1of1ForFork0_~i~0#1_387| 3) (not (= (ite (and (<= 0 v_~x1~0_441) (< v_~x1~0_441 v_~size~0_246)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_246)) 1 0)))))) InVars {#pthreadsForks=|v_#pthreadsForks_106|, ~size~0=v_~size~0_246, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_67|, ~f~0.base=v_~f~0.base_242, #memory_int=|v_#memory_int_353|, ~n~0=v_~n~0_245, ~x1~0=v_~x1~0_441, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_67|, ~f~0.offset=v_~f~0.offset_242} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_249|, ~size~0=v_~size~0_246, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_67|, ~f~0.base=v_~f~0.base_242, ~x1~0=v_~x1~0_440, ~f~0.offset=v_~f~0.offset_242, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_231|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_73|, #pthreadsForks=|v_#pthreadsForks_105|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_387|, #memory_int=|v_#memory_int_352|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_247|, ~n~0=v_~n~0_245, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_257|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_67|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:01,149 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:49:01,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2368 [2022-12-13 13:49:01,150 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 426 transitions, 14439 flow [2022-12-13 13:49:01,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:01,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:49:01,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:49:01,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 13:49:01,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:01,351 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:49:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:49:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1308785992, now seen corresponding path program 1 times [2022-12-13 13:49:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:49:01,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137903457] [2022-12-13 13:49:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:49:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:49:01,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137903457] [2022-12-13 13:49:01,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137903457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:49:01,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56636696] [2022-12-13 13:49:01,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:01,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:01,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:49:01,405 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:49:01,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 13:49:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:01,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:49:01,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:49:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:01,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:49:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:01,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56636696] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:49:01,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:49:01,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 13:49:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256315844] [2022-12-13 13:49:01,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:49:01,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:49:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:49:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:49:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:49:01,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 92 [2022-12-13 13:49:01,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 426 transitions, 14439 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:01,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:49:01,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 92 [2022-12-13 13:49:01,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:49:03,408 INFO L130 PetriNetUnfolder]: 2197/4106 cut-off events. [2022-12-13 13:49:03,408 INFO L131 PetriNetUnfolder]: For 339067/339067 co-relation queries the response was YES. [2022-12-13 13:49:03,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58798 conditions, 4106 events. 2197/4106 cut-off events. For 339067/339067 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 29030 event pairs, 967 based on Foata normal form. 6/4102 useless extension candidates. Maximal degree in co-relation 58189. Up to 3913 conditions per place. [2022-12-13 13:49:03,459 INFO L137 encePairwiseOnDemand]: 67/92 looper letters, 392 selfloop transitions, 59 changer transitions 2/453 dead transitions. [2022-12-13 13:49:03,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 453 transitions, 16082 flow [2022-12-13 13:49:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:49:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:49:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 13:49:03,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20108695652173914 [2022-12-13 13:49:03,460 INFO L175 Difference]: Start difference. First operand has 315 places, 426 transitions, 14439 flow. Second operand 6 states and 111 transitions. [2022-12-13 13:49:03,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 453 transitions, 16082 flow [2022-12-13 13:49:04,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 453 transitions, 15636 flow, removed 151 selfloop flow, removed 8 redundant places. [2022-12-13 13:49:04,763 INFO L231 Difference]: Finished difference. Result has 314 places, 432 transitions, 14263 flow [2022-12-13 13:49:04,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=13999, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14263, PETRI_PLACES=314, PETRI_TRANSITIONS=432} [2022-12-13 13:49:04,764 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 293 predicate places. [2022-12-13 13:49:04,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:49:04,764 INFO L89 Accepts]: Start accepts. Operand has 314 places, 432 transitions, 14263 flow [2022-12-13 13:49:04,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:49:04,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:49:04,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 432 transitions, 14263 flow [2022-12-13 13:49:04,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 432 transitions, 14263 flow [2022-12-13 13:49:05,038 INFO L130 PetriNetUnfolder]: 477/1545 cut-off events. [2022-12-13 13:49:05,038 INFO L131 PetriNetUnfolder]: For 132069/132562 co-relation queries the response was YES. [2022-12-13 13:49:05,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22085 conditions, 1545 events. 477/1545 cut-off events. For 132069/132562 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 13930 event pairs, 71 based on Foata normal form. 35/1523 useless extension candidates. Maximal degree in co-relation 21784. Up to 586 conditions per place. [2022-12-13 13:49:05,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 432 transitions, 14263 flow [2022-12-13 13:49:05,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 1356 [2022-12-13 13:49:05,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_181| v_~f~0.base_110))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_110 (* v_~x1~0_162 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_110 (* v_~x2~0_120 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= (ite (and (< v_~x2~0_120 v_~size~0_122) (<= 0 v_~x2~0_120)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_162) (< v_~x1~0_162 v_~size~0_122)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_136| 2) (< 1 (* 2 (mod v_~n~0_121 2147483648))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_97|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_122)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|) (= (select .cse1 (+ v_~f~0.offset_110 (* .cse2 4))) v_~x2~0_119) (= v_~x1~0_160 (select .cse1 (+ v_~f~0.offset_110 (* .cse0 4)))) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_122)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0))))) InVars {~x2~0=v_~x2~0_120, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, #memory_int=|v_#memory_int_181|, ~n~0=v_~n~0_121, ~x1~0=v_~x1~0_162, ~f~0.offset=v_~f~0.offset_110} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_88|, ~x2~0=v_~x2~0_119, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_48|, ~size~0=v_~size~0_122, ~f~0.base=v_~f~0.base_110, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_97|, ~x1~0=v_~x1~0_160, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_70|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86|, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_38|, ~n~0=v_~n~0_121, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_96|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [643] L59-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_251| v_~f~0.base_160))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_160 (* v_~x2~0_189 4)))) (.cse2 (* (mod v_~n~0_165 2147483648) 2))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (= v_~x2~0_188 (select .cse0 (+ v_~f~0.offset_160 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_151|) |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_166)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= v_~x1~0_239 (select .cse0 (+ v_~f~0.offset_160 (* v_~x1~0_240 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| (+ |v_thread1Thread1of1ForFork0_~i~0#1_196| 1)) (not (= (ite (and (< v_~x2~0_189 v_~size~0_166) (<= 0 v_~x2~0_189)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| (ite (and (<= 0 v_~x1~0_240) (< v_~x1~0_240 v_~size~0_166)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_151| 4294967296) .cse2) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_196| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|)))) InVars {~x2~0=v_~x2~0_189, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_196|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_151|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_160} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_127|, ~x2~0=v_~x2~0_188, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_85|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~x1~0=v_~x1~0_239, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_71|, ~n~0=v_~n~0_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:05,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_235| v_~f~0.base_144))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_212 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648))) (.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_157 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x1~0_211) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_166| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_150)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4))) v_~x2~0_156) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_121|) |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= (ite (and (< v_~x1~0_212 v_~size~0_150) (<= 0 v_~x1~0_212)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_121| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_165| 4294967295) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= |v_thread1Thread1of1ForFork0_~i~0#1_165| (+ |v_thread1Thread1of1ForFork0_~i~0#1_166| 2)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|)))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, #memory_int=|v_#memory_int_235|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_144} OutVars{~x2~0=v_~x2~0_156, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_113|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_211, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_165|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_121|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [714] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_381| v_~f~0.base_262))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_262 (* v_~x1~0_509 4))))) (let ((.cse0 (* 2 (mod v_~n~0_265 2147483648))) (.cse4 (select .cse3 (+ v_~f~0.offset_262 (* v_~x2~0_414 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_262 (* 4 .cse1))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_275| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_345| 4294967296) .cse0) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_266)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_436| 4294967295) 4294967296) .cse0) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_266)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_275|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_437| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_436| (+ |v_thread1Thread1of1ForFork0_~i~0#1_437| 3)) (not (= (ite (and (< v_~x2~0_414 v_~size~0_266) (<= 0 v_~x2~0_414)) 1 0) 0)) (= v_~x2~0_413 (select .cse3 (+ v_~f~0.offset_262 (* .cse4 4)))) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_345|) |v_thread2Thread1of1ForFork1_~i~1#1_344|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_266)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_259|) (not (= (ite (and (< v_~x1~0_509 v_~size~0_266) (<= 0 v_~x1~0_509)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291| 0)) (= v_~x1~0_508 (select .cse3 (+ v_~f~0.offset_262 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_259| 0)))))) InVars {~x2~0=v_~x2~0_414, ~size~0=v_~size~0_266, ~f~0.base=v_~f~0.base_262, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_437|, #memory_int=|v_#memory_int_381|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_345|, ~n~0=v_~n~0_265, ~x1~0=v_~x1~0_509, ~f~0.offset=v_~f~0.offset_262} OutVars{~x2~0=v_~x2~0_413, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_293|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, ~size~0=v_~size~0_266, ~f~0.base=v_~f~0.base_262, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_225|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_344|, ~x1~0=v_~x1~0_508, ~f~0.offset=v_~f~0.offset_262, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_259|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_275|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_436|, #memory_int=|v_#memory_int_381|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_291|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_211|, ~n~0=v_~n~0_265, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_211|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_301|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:07,242 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:49:07,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2479 [2022-12-13 13:49:07,243 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 432 transitions, 14344 flow [2022-12-13 13:49:07,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:07,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:49:07,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:49:07,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 13:49:07,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-13 13:49:07,444 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:49:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:49:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -334361554, now seen corresponding path program 1 times [2022-12-13 13:49:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:49:07,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640498445] [2022-12-13 13:49:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:49:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:09,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:49:09,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640498445] [2022-12-13 13:49:09,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640498445] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:49:09,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286164940] [2022-12-13 13:49:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:09,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:09,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:49:09,873 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:49:09,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 13:49:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:09,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 13:49:09,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:49:10,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:49:10,024 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 38 treesize of output 36 [2022-12-13 13:49:10,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:49:10,086 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 76 [2022-12-13 13:49:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:10,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:49:10,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:49:10,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 13:49:10,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:49:10,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 152 [2022-12-13 13:49:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286164940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:49:14,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:49:14,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:49:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968929894] [2022-12-13 13:49:14,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:49:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:49:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:49:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:49:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:49:14,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 94 [2022-12-13 13:49:14,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 432 transitions, 14344 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:14,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:49:14,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 94 [2022-12-13 13:49:14,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:49:16,452 INFO L130 PetriNetUnfolder]: 2340/4368 cut-off events. [2022-12-13 13:49:16,453 INFO L131 PetriNetUnfolder]: For 363231/363231 co-relation queries the response was YES. [2022-12-13 13:49:16,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62699 conditions, 4368 events. 2340/4368 cut-off events. For 363231/363231 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 30964 event pairs, 779 based on Foata normal form. 2/4360 useless extension candidates. Maximal degree in co-relation 62092. Up to 3568 conditions per place. [2022-12-13 13:49:16,507 INFO L137 encePairwiseOnDemand]: 32/94 looper letters, 349 selfloop transitions, 145 changer transitions 9/503 dead transitions. [2022-12-13 13:49:16,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 503 transitions, 16757 flow [2022-12-13 13:49:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:49:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:49:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2022-12-13 13:49:16,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1653771760154739 [2022-12-13 13:49:16,508 INFO L175 Difference]: Start difference. First operand has 311 places, 432 transitions, 14344 flow. Second operand 11 states and 171 transitions. [2022-12-13 13:49:16,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 503 transitions, 16757 flow [2022-12-13 13:49:17,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 503 transitions, 16522 flow, removed 88 selfloop flow, removed 3 redundant places. [2022-12-13 13:49:17,878 INFO L231 Difference]: Finished difference. Result has 321 places, 452 transitions, 15166 flow [2022-12-13 13:49:17,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=14111, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15166, PETRI_PLACES=321, PETRI_TRANSITIONS=452} [2022-12-13 13:49:17,878 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 300 predicate places. [2022-12-13 13:49:17,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:49:17,879 INFO L89 Accepts]: Start accepts. Operand has 321 places, 452 transitions, 15166 flow [2022-12-13 13:49:17,881 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:49:17,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:49:17,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 452 transitions, 15166 flow [2022-12-13 13:49:17,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 452 transitions, 15166 flow [2022-12-13 13:49:18,246 INFO L130 PetriNetUnfolder]: 511/1646 cut-off events. [2022-12-13 13:49:18,247 INFO L131 PetriNetUnfolder]: For 147403/147951 co-relation queries the response was YES. [2022-12-13 13:49:18,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24091 conditions, 1646 events. 511/1646 cut-off events. For 147403/147951 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15042 event pairs, 84 based on Foata normal form. 35/1619 useless extension candidates. Maximal degree in co-relation 23787. Up to 635 conditions per place. [2022-12-13 13:49:18,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 452 transitions, 15166 flow [2022-12-13 13:49:18,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 1450 [2022-12-13 13:49:18,277 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:49:18,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 399 [2022-12-13 13:49:18,277 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 452 transitions, 15166 flow [2022-12-13 13:49:18,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:18,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:49:18,278 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:49:18,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 13:49:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-13 13:49:18,483 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:49:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:49:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash -495493109, now seen corresponding path program 2 times [2022-12-13 13:49:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:49:18,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389275029] [2022-12-13 13:49:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:49:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:18,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:49:18,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389275029] [2022-12-13 13:49:18,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389275029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:49:18,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213277753] [2022-12-13 13:49:18,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:49:18,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:18,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:49:18,551 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:49:18,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 13:49:18,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:49:18,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:49:18,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 13:49:18,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:49:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:18,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:49:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:18,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213277753] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:49:18,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:49:18,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:49:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123448949] [2022-12-13 13:49:18,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:49:18,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:49:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:49:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:49:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:49:18,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 94 [2022-12-13 13:49:18,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 452 transitions, 15166 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:18,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:49:18,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 94 [2022-12-13 13:49:18,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:49:23,988 INFO L130 PetriNetUnfolder]: 2561/4845 cut-off events. [2022-12-13 13:49:23,988 INFO L131 PetriNetUnfolder]: For 416292/416292 co-relation queries the response was YES. [2022-12-13 13:49:24,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70340 conditions, 4845 events. 2561/4845 cut-off events. For 416292/416292 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 35966 event pairs, 286 based on Foata normal form. 28/4863 useless extension candidates. Maximal degree in co-relation 69729. Up to 1852 conditions per place. [2022-12-13 13:49:24,055 INFO L137 encePairwiseOnDemand]: 20/94 looper letters, 393 selfloop transitions, 309 changer transitions 7/709 dead transitions. [2022-12-13 13:49:24,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 709 transitions, 23559 flow [2022-12-13 13:49:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 13:49:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 13:49:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 199 transitions. [2022-12-13 13:49:24,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10585106382978723 [2022-12-13 13:49:24,057 INFO L175 Difference]: Start difference. First operand has 320 places, 452 transitions, 15166 flow. Second operand 20 states and 199 transitions. [2022-12-13 13:49:24,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 709 transitions, 23559 flow [2022-12-13 13:49:25,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 709 transitions, 23155 flow, removed 158 selfloop flow, removed 4 redundant places. [2022-12-13 13:49:25,641 INFO L231 Difference]: Finished difference. Result has 348 places, 558 transitions, 19654 flow [2022-12-13 13:49:25,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=14868, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=19654, PETRI_PLACES=348, PETRI_TRANSITIONS=558} [2022-12-13 13:49:25,642 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 327 predicate places. [2022-12-13 13:49:25,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:49:25,642 INFO L89 Accepts]: Start accepts. Operand has 348 places, 558 transitions, 19654 flow [2022-12-13 13:49:25,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:49:25,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:49:25,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 348 places, 558 transitions, 19654 flow [2022-12-13 13:49:25,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 348 places, 558 transitions, 19654 flow [2022-12-13 13:49:26,038 INFO L130 PetriNetUnfolder]: 600/1881 cut-off events. [2022-12-13 13:49:26,038 INFO L131 PetriNetUnfolder]: For 210335/210723 co-relation queries the response was YES. [2022-12-13 13:49:26,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29907 conditions, 1881 events. 600/1881 cut-off events. For 210335/210723 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 17456 event pairs, 82 based on Foata normal form. 35/1871 useless extension candidates. Maximal degree in co-relation 29577. Up to 723 conditions per place. [2022-12-13 13:49:26,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 348 places, 558 transitions, 19654 flow [2022-12-13 13:49:26,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 1606 [2022-12-13 13:49:26,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_377| v_~f~0.base_260))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_260 (* v_~x1~0_500 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_260 (* v_~x2~0_408 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_260 (* 4 .cse7))))) (let ((.cse4 (select .cse3 (+ (* .cse0 4) v_~f~0.offset_260))) (.cse6 (select .cse3 (+ v_~f~0.offset_260 (* .cse1 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_260 (* .cse6 4)))) (.cse5 (select .cse3 (+ v_~f~0.offset_260 (* .cse4 4))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_340| 4) (not (= (ite (and (< .cse0 v_~size~0_264) (<= 0 .cse0)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_255| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_429| 4294967295) 4294967296) (* 2 (mod v_~n~0_263 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_429| 5) (not (= (ite (and (< .cse1 v_~size~0_264) (<= 0 .cse1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_284|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (and (< .cse2 v_~size~0_264) (<= 0 .cse2)) 1 0)) (= (select .cse3 (+ (* 4 .cse2) v_~f~0.offset_260)) v_~x2~0_407) (not (= 0 (ite (and (< .cse4 v_~size~0_264) (<= 0 .cse4)) 1 0))) (not (= (ite (and (< v_~x2~0_408 v_~size~0_264) (<= 0 v_~x2~0_408)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_284| 0)) (= (select .cse3 (+ v_~f~0.offset_260 (* .cse5 4))) v_~x1~0_498) (not (= (ite (and (< .cse6 v_~size~0_264) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_264)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_264)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_500) (< v_~x1~0_500 v_~size~0_264)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_408, ~size~0=v_~size~0_264, ~f~0.base=v_~f~0.base_260, #memory_int=|v_#memory_int_377|, ~n~0=v_~n~0_263, ~x1~0=v_~x1~0_500, ~f~0.offset=v_~f~0.offset_260} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_286|, ~x2~0=v_~x2~0_407, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_217|, ~size~0=v_~size~0_264, ~f~0.base=v_~f~0.base_260, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_221|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_340|, ~x1~0=v_~x1~0_498, ~f~0.offset=v_~f~0.offset_260, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_255|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_429|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_284|, #memory_int=|v_#memory_int_377|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_207|, ~n~0=v_~n~0_263, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_294|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_207|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:26,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:26,709 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:26,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:26,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:26,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:27,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-13 13:49:27,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:27,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:27,358 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:27,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:27,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:27,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:49:27,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 13:49:27,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:27,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:27,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:28,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:28,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:28,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (* (mod v_~n~0_In_3 2147483648) 2))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:28,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [706] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_367| v_~f~0.base_250))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_250 (* v_~x2~0_389 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_250 (* .cse5 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_250 (* .cse1 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_250 (* 4 .cse7))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_250 (* .cse0 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_250 (* v_~x1~0_475 4)))) (.cse8 (select .cse3 (+ v_~f~0.offset_250 (* 4 .cse9))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_250 (* .cse8 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_250 (* .cse6 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_411| 3) (< 6 (* 2 (mod v_~n~0_253 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_254)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_254| (ite (and (< .cse2 v_~size~0_254) (<= 0 .cse2)) 1 0)) (= v_~x2~0_387 (select .cse3 (+ v_~f~0.offset_250 (* .cse4 4)))) (not (= (ite (and (< .cse5 v_~size~0_254) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_254) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_326| 8) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_254| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_254)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| (ite (and (< .cse4 v_~size~0_254) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse9 v_~size~0_254) (<= 0 .cse9)) 1 0) 0)) (= (select .cse3 (+ (* .cse2 4) v_~f~0.offset_250)) v_~x1~0_474) (not (= (ite (and (<= 0 v_~x2~0_389) (< v_~x2~0_389 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_475 v_~size~0_254) (<= 0 v_~x1~0_475)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_389, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_250, #memory_int=|v_#memory_int_367|, ~n~0=v_~n~0_253, ~x1~0=v_~x1~0_475, ~f~0.offset=v_~f~0.offset_250} OutVars{~x2~0=v_~x2~0_387, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_272|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_205|, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_250, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_209|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_326|, ~x1~0=v_~x1~0_474, ~f~0.offset=v_~f~0.offset_250, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_243|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_254|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_411|, #memory_int=|v_#memory_int_367|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_195|, ~n~0=v_~n~0_253, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_195|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_280|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:49:28,831 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 13:49:28,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3190 [2022-12-13 13:49:28,832 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 556 transitions, 20456 flow [2022-12-13 13:49:28,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:28,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:49:28,832 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:49:28,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 13:49:29,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:29,040 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:49:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:49:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -279415761, now seen corresponding path program 3 times [2022-12-13 13:49:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:49:29,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607172932] [2022-12-13 13:49:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:49:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:49:29,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607172932] [2022-12-13 13:49:29,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607172932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:49:29,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622701604] [2022-12-13 13:49:29,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:49:29,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:49:29,122 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:49:29,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 13:49:29,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 13:49:29,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:49:29,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 13:49:29,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:49:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:29,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:49:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:29,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622701604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:49:29,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:49:29,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 13:49:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799619004] [2022-12-13 13:49:29,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:49:29,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:49:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:49:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:49:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:49:29,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 115 [2022-12-13 13:49:29,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 556 transitions, 20456 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:29,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:49:29,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 115 [2022-12-13 13:49:29,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:49:33,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:37,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:41,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:43,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:45,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:48,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:50,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:53,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:55,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:49:58,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:50:02,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:50:04,476 INFO L130 PetriNetUnfolder]: 2687/5064 cut-off events. [2022-12-13 13:50:04,476 INFO L131 PetriNetUnfolder]: For 584349/584349 co-relation queries the response was YES. [2022-12-13 13:50:04,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80423 conditions, 5064 events. 2687/5064 cut-off events. For 584349/584349 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 37594 event pairs, 783 based on Foata normal form. 106/5160 useless extension candidates. Maximal degree in co-relation 79766. Up to 2954 conditions per place. [2022-12-13 13:50:04,586 INFO L137 encePairwiseOnDemand]: 19/115 looper letters, 333 selfloop transitions, 387 changer transitions 4/724 dead transitions. [2022-12-13 13:50:04,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 724 transitions, 26300 flow [2022-12-13 13:50:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 13:50:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 13:50:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 289 transitions. [2022-12-13 13:50:04,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.07391304347826087 [2022-12-13 13:50:04,588 INFO L175 Difference]: Start difference. First operand has 346 places, 556 transitions, 20456 flow. Second operand 34 states and 289 transitions. [2022-12-13 13:50:04,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 724 transitions, 26300 flow [2022-12-13 13:50:07,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 724 transitions, 24752 flow, removed 731 selfloop flow, removed 3 redundant places. [2022-12-13 13:50:07,616 INFO L231 Difference]: Finished difference. Result has 392 places, 614 transitions, 21931 flow [2022-12-13 13:50:07,616 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=17914, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=21931, PETRI_PLACES=392, PETRI_TRANSITIONS=614} [2022-12-13 13:50:07,616 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 371 predicate places. [2022-12-13 13:50:07,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:50:07,616 INFO L89 Accepts]: Start accepts. Operand has 392 places, 614 transitions, 21931 flow [2022-12-13 13:50:07,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:50:07,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:50:07,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 392 places, 614 transitions, 21931 flow [2022-12-13 13:50:07,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 390 places, 614 transitions, 21931 flow [2022-12-13 13:50:08,042 INFO L130 PetriNetUnfolder]: 647/1962 cut-off events. [2022-12-13 13:50:08,042 INFO L131 PetriNetUnfolder]: For 279175/279663 co-relation queries the response was YES. [2022-12-13 13:50:08,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34261 conditions, 1962 events. 647/1962 cut-off events. For 279175/279663 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18014 event pairs, 91 based on Foata normal form. 31/1937 useless extension candidates. Maximal degree in co-relation 33912. Up to 735 conditions per place. [2022-12-13 13:50:08,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 390 places, 614 transitions, 21931 flow [2022-12-13 13:50:08,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 1696 [2022-12-13 13:50:08,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_315| v_~f~0.base_212))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_212 (* v_~x2~0_298 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_212 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_212)))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_252| 4) (= v_~x2~0_296 (select .cse0 (+ v_~f~0.offset_212 (* .cse1 4)))) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_252|) 4294967296) (* 2 (mod v_~n~0_215 2147483648))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_216)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_216) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_216)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|) (not (= (ite (and (<= 0 v_~x2~0_298) (< v_~x2~0_298 v_~size~0_216)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_298, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, #memory_int=|v_#memory_int_315|, ~n~0=v_~n~0_215, ~f~0.offset=v_~f~0.offset_212} OutVars{~x2~0=v_~x2~0_296, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_145|, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_149|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_252|, ~f~0.offset=v_~f~0.offset_212, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|, #memory_int=|v_#memory_int_315|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_135|, ~n~0=v_~n~0_215, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_135|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [679] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_322| v_~f~0.base_218))) (let ((.cse1 (* 2 (mod v_~n~0_221 2147483648))) (.cse0 (select .cse2 (+ v_~f~0.offset_218 (* v_~x1~0_369 4))))) (and (= (ite (and (< .cse0 v_~size~0_222) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_326| 4294967296) .cse1) (not (= (ite (and (<= 0 v_~x1~0_369) (< v_~x1~0_369 v_~size~0_222)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_326| 1) 4294967296) .cse1) (= |v_thread1Thread1of1ForFork0_~i~0#1_324| (+ |v_thread1Thread1of1ForFork0_~i~0#1_326| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202| 0)) (= (select .cse2 (+ v_~f~0.offset_218 (* .cse0 4))) v_~x1~0_367)))) InVars {~size~0=v_~size~0_222, ~f~0.base=v_~f~0.base_218, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_326|, #memory_int=|v_#memory_int_322|, ~n~0=v_~n~0_221, ~x1~0=v_~x1~0_369, ~f~0.offset=v_~f~0.offset_218} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_204|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186|, ~size~0=v_~size~0_222, ~f~0.base=v_~f~0.base_218, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_324|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|, #memory_int=|v_#memory_int_322|, ~n~0=v_~n~0_221, ~x1~0=v_~x1~0_367, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_212|, ~f~0.offset=v_~f~0.offset_218} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:08,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_315| v_~f~0.base_212))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_212 (* v_~x2~0_298 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_212 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_212)))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_252| 4) (= v_~x2~0_296 (select .cse0 (+ v_~f~0.offset_212 (* .cse1 4)))) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_252|) 4294967296) (* 2 (mod v_~n~0_215 2147483648))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_216)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_216) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_216)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|) (not (= (ite (and (<= 0 v_~x2~0_298) (< v_~x2~0_298 v_~size~0_216)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_298, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, #memory_int=|v_#memory_int_315|, ~n~0=v_~n~0_215, ~f~0.offset=v_~f~0.offset_212} OutVars{~x2~0=v_~x2~0_296, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_145|, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_149|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_252|, ~f~0.offset=v_~f~0.offset_212, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|, #memory_int=|v_#memory_int_315|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_135|, ~n~0=v_~n~0_215, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_135|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [680] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_324| v_~f~0.base_220))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_220 (* v_~x2~0_315 4)))) (.cse0 (* 2 (mod v_~n~0_223 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196| 0)) (= (ite (and (< v_~x1~0_374 v_~size~0_224) (<= 0 v_~x1~0_374)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_331| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_220 (* .cse2 4))) v_~x2~0_314) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (and (< .cse2 v_~size~0_224) (<= 0 .cse2)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_266|) |v_thread2Thread1of1ForFork1_~i~1#1_265|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_266| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_330| (+ |v_thread1Thread1of1ForFork0_~i~0#1_331| 1)) (= (select .cse1 (+ v_~f~0.offset_220 (* v_~x1~0_374 4))) v_~x1~0_373) (not (= (ite (and (<= 0 v_~x2~0_315) (< v_~x2~0_315 v_~size~0_224)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_315, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_220, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_331|, #memory_int=|v_#memory_int_324|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_266|, ~n~0=v_~n~0_223, ~x1~0=v_~x1~0_374, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_314, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_162|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_265|, ~x1~0=v_~x1~0_373, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_196|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_330|, #memory_int=|v_#memory_int_324|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_206|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_148|, ~n~0=v_~n~0_223, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_148|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_216|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:08,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_315| v_~f~0.base_212))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_212 (* v_~x2~0_298 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_212 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_212)))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_252| 4) (= v_~x2~0_296 (select .cse0 (+ v_~f~0.offset_212 (* .cse1 4)))) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_252|) 4294967296) (* 2 (mod v_~n~0_215 2147483648))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_216)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_216) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_216)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|) (not (= (ite (and (<= 0 v_~x2~0_298) (< v_~x2~0_298 v_~size~0_216)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_298, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, #memory_int=|v_#memory_int_315|, ~n~0=v_~n~0_215, ~f~0.offset=v_~f~0.offset_212} OutVars{~x2~0=v_~x2~0_296, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_145|, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_149|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_252|, ~f~0.offset=v_~f~0.offset_212, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|, #memory_int=|v_#memory_int_315|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_135|, ~n~0=v_~n~0_215, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_135|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [688] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_336| v_~f~0.base_230))) (let ((.cse0 (* (mod v_~n~0_233 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_230 (* v_~x2~0_331 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_230 (* v_~x1~0_399 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_354| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x1~0_399) (< v_~x1~0_399 v_~size~0_234)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_352| 4294967295) 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_230 (* .cse2 4))) v_~x2~0_330) (not (= (ite (and (<= 0 v_~x2~0_331) (< v_~x2~0_331 v_~size~0_234)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_282| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_230 (* .cse3 4))) v_~x1~0_397) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_204| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_182| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_234)) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_354| 2) |v_thread1Thread1of1ForFork0_~i~0#1_352|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220| 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_234)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_204|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_182| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_281| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_282|))))) InVars {~x2~0=v_~x2~0_331, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_354|, #memory_int=|v_#memory_int_336|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_282|, ~n~0=v_~n~0_233, ~x1~0=v_~x1~0_399, ~f~0.offset=v_~f~0.offset_230} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_222|, ~x2~0=v_~x2~0_330, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_168|, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_230, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_172|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_182|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_281|, ~x1~0=v_~x1~0_397, ~f~0.offset=v_~f~0.offset_230, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_204|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_352|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220|, #memory_int=|v_#memory_int_336|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_158|, ~n~0=v_~n~0_233, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_230|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_158|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:50:09,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_315| v_~f~0.base_212))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_212 (* v_~x2~0_298 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_212 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_212)))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_252| 4) (= v_~x2~0_296 (select .cse0 (+ v_~f~0.offset_212 (* .cse1 4)))) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_252|) 4294967296) (* 2 (mod v_~n~0_215 2147483648))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_216)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_216) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_216)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|) (not (= (ite (and (<= 0 v_~x2~0_298) (< v_~x2~0_298 v_~size~0_216)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_298, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, #memory_int=|v_#memory_int_315|, ~n~0=v_~n~0_215, ~f~0.offset=v_~f~0.offset_212} OutVars{~x2~0=v_~x2~0_296, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_145|, ~size~0=v_~size~0_216, ~f~0.base=v_~f~0.base_212, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_149|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_252|, ~f~0.offset=v_~f~0.offset_212, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_183|, #memory_int=|v_#memory_int_315|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_135|, ~n~0=v_~n~0_215, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_135|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [686] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_332| v_~f~0.base_228))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_228 (* v_~x1~0_387 4)))) (.cse2 (* (mod v_~n~0_231 2147483648) 2))) (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_45| 0) (= v_~x1~0_385 (select .cse0 (+ v_~f~0.offset_228 (* .cse1 4)))) (= (ite (and (< .cse1 v_~size~0_232) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_344| 4294967296) .cse2) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_342| 4294967295) 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x1~0_387) (< v_~x1~0_387 v_~size~0_232)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_342| (+ |v_thread1Thread1of1ForFork0_~i~0#1_344| 2)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_277| 4294967296) .cse2))))) InVars {~size~0=v_~size~0_232, ~f~0.base=v_~f~0.base_228, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_344|, #memory_int=|v_#memory_int_332|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_277|, ~n~0=v_~n~0_231, ~x1~0=v_~x1~0_387, ~f~0.offset=v_~f~0.offset_228} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, ~size~0=v_~size~0_232, ~f~0.base=v_~f~0.base_228, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_277|, ~x1~0=v_~x1~0_385, ~f~0.offset=v_~f~0.offset_228, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_196|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_45|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_342|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|, #memory_int=|v_#memory_int_332|, ~n~0=v_~n~0_231, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_222|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:09,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:09,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:10,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:10,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [671] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_311| v_~f~0.base_208))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_208 (* v_~x2~0_289 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_309| (+ |v_thread1Thread1of1ForFork0_~i~0#1_310| 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_248|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_310| 4294967296) (* 2 (mod v_~n~0_211 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_212)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_208 (* v_~x1~0_354 4))) v_~x1~0_353) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178| (ite (and (<= 0 v_~x1~0_354) (< v_~x1~0_354 v_~size~0_212)) 1 0)) (not (= (ite (and (< v_~x2~0_289 v_~size~0_212) (<= 0 v_~x2~0_289)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (= (select .cse1 (+ v_~f~0.offset_208 (* .cse0 4))) v_~x2~0_288)))) InVars {~x2~0=v_~x2~0_289, ~size~0=v_~size~0_212, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_310|, #memory_int=|v_#memory_int_311|, ~n~0=v_~n~0_211, ~x1~0=v_~x1~0_354, ~f~0.offset=v_~f~0.offset_208} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_196|, ~x2~0=v_~x2~0_288, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_141|, ~size~0=v_~size~0_212, ~f~0.base=v_~f~0.base_208, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_145|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_248|, ~x1~0=v_~x1~0_353, ~f~0.offset=v_~f~0.offset_208, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|, #memory_int=|v_#memory_int_311|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_131|, ~n~0=v_~n~0_211, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_204|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_131|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [736] L59-2-->L49-2: Formula: (let ((.cse0 (* 2 (mod v_~n~0_291 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325| (ite (and (< v_~x1~0_585 v_~size~0_292) (<= 0 v_~x1~0_585)) 1 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_68|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_495| 4294967296) .cse0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_383| 4294967296) .cse0)) (= v_~x1~0_584 (select (select |v_#memory_int_414| v_~f~0.base_288) (+ v_~f~0.offset_288 (* v_~x1~0_585 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_494| (+ |v_thread1Thread1of1ForFork0_~i~0#1_495| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_68| 0))) InVars {~size~0=v_~size~0_292, ~f~0.base=v_~f~0.base_288, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_495|, #memory_int=|v_#memory_int_414|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_383|, ~n~0=v_~n~0_291, ~x1~0=v_~x1~0_585, ~f~0.offset=v_~f~0.offset_288} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_343|, ~size~0=v_~size~0_292, ~f~0.base=v_~f~0.base_288, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_383|, ~x1~0=v_~x1~0_584, ~f~0.offset=v_~f~0.offset_288, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_68|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_494|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|, #memory_int=|v_#memory_int_414|, ~n~0=v_~n~0_291, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_351|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:10,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [671] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_311| v_~f~0.base_208))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_208 (* v_~x2~0_289 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_309| (+ |v_thread1Thread1of1ForFork0_~i~0#1_310| 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_248|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_310| 4294967296) (* 2 (mod v_~n~0_211 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_212)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_208 (* v_~x1~0_354 4))) v_~x1~0_353) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178| (ite (and (<= 0 v_~x1~0_354) (< v_~x1~0_354 v_~size~0_212)) 1 0)) (not (= (ite (and (< v_~x2~0_289 v_~size~0_212) (<= 0 v_~x2~0_289)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (= (select .cse1 (+ v_~f~0.offset_208 (* .cse0 4))) v_~x2~0_288)))) InVars {~x2~0=v_~x2~0_289, ~size~0=v_~size~0_212, ~f~0.base=v_~f~0.base_208, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_310|, #memory_int=|v_#memory_int_311|, ~n~0=v_~n~0_211, ~x1~0=v_~x1~0_354, ~f~0.offset=v_~f~0.offset_208} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_196|, ~x2~0=v_~x2~0_288, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_141|, ~size~0=v_~size~0_212, ~f~0.base=v_~f~0.base_208, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_145|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_248|, ~x1~0=v_~x1~0_353, ~f~0.offset=v_~f~0.offset_208, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|, #memory_int=|v_#memory_int_311|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_131|, ~n~0=v_~n~0_211, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_204|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_131|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:50:12,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_469| v_~f~0.base_342))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_342 (* v_~x2~0_550 4))))) (let ((.cse3 (select .cse1 (+ (* 4 .cse4) v_~f~0.offset_342)))) (let ((.cse0 (* (mod v_~n~0_349 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_342 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_593| (+ |v_thread1Thread1of1ForFork0_~i~0#1_594| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_383| 0)) (< 2 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_367| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_383|) (= |v_thread2Thread1of1ForFork1_~i~1#1_474| 4) (= v_~x2~0_548 (select .cse1 (+ v_~f~0.offset_342 (* 4 .cse2)))) (not (= 0 (ite (and (< v_~x2~0_550 v_~size~0_346) (<= 0 v_~x2~0_550)) 1 0))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_594| 4294967296) .cse0) (= (select .cse1 (+ (* v_~x1~0_661 4) v_~f~0.offset_342)) v_~x1~0_660) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_346)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_346)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_315| (ite (and (< .cse2 v_~size~0_346) (<= 0 .cse2)) 1 0)) (= (ite (and (< v_~x1~0_661 v_~size~0_346) (<= 0 v_~x1~0_661)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_367|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_315| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_339|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_339| 0))))))) InVars {~x2~0=v_~x2~0_550, ~size~0=v_~size~0_346, ~f~0.base=v_~f~0.base_342, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_594|, #memory_int=|v_#memory_int_469|, ~n~0=v_~n~0_349, ~x1~0=v_~x1~0_661, ~f~0.offset=v_~f~0.offset_342} OutVars{~x2~0=v_~x2~0_548, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_385|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_301|, ~size~0=v_~size~0_346, ~f~0.base=v_~f~0.base_342, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_305|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_315|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_474|, ~x1~0=v_~x1~0_660, ~f~0.offset=v_~f~0.offset_342, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_339|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_367|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_593|, #memory_int=|v_#memory_int_469|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_383|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_291|, ~n~0=v_~n~0_349, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_291|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_393|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:13,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [707] $Ultimate##0-->L49-2: Formula: (let ((.cse7 (select |v_#memory_int_369| v_~f~0.base_252))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_252 (* v_~x2~0_394 4))))) (let ((.cse1 (select .cse7 (+ v_~f~0.offset_252 (* .cse8 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_252 (* v_~x1~0_480 4)))) (.cse2 (select .cse7 (+ v_~f~0.offset_252 (* .cse1 4))))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_252 (* .cse2 4)))) (.cse0 (select .cse7 (+ v_~f~0.offset_252 (* .cse3 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_252 (* .cse0 4)))) (.cse4 (select .cse7 (+ (* .cse6 4) v_~f~0.offset_252)))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_256)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_272|) (not (= (ite (and (< .cse1 v_~size~0_256) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247| 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_330|) 4294967296) (* (mod v_~n~0_255 2147483648) 2)) (not (= (ite (and (< .cse2 v_~size~0_256) (<= 0 .cse2)) 1 0) 0)) (not (= 0 (ite (and (< v_~x2~0_394 v_~size~0_256) (<= 0 v_~x2~0_394)) 1 0))) (not (= (ite (and (< .cse3 v_~size~0_256) (<= 0 .cse3)) 1 0) 0)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_256)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|) (not (= (ite (and (<= 0 v_~x1~0_480) (< v_~x1~0_480 v_~size~0_256)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| (ite (and (< .cse5 v_~size~0_256) (<= 0 .cse5)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_272| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_256)) 1 0) 0)) (= v_~x1~0_478 (select .cse7 (+ v_~f~0.offset_252 (* .cse5 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_413| 4) (not (= (ite (and (< .cse8 v_~size~0_256) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_330|) (= (select .cse7 (+ v_~f~0.offset_252 (* .cse4 4))) v_~x2~0_393)))))))) InVars {~x2~0=v_~x2~0_394, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_252, #memory_int=|v_#memory_int_369|, ~n~0=v_~n~0_255, ~x1~0=v_~x1~0_480, ~f~0.offset=v_~f~0.offset_252} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_274|, ~x2~0=v_~x2~0_393, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_209|, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_252, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_213|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_330|, ~x1~0=v_~x1~0_478, ~f~0.offset=v_~f~0.offset_252, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_413|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_272|, #memory_int=|v_#memory_int_369|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_199|, ~n~0=v_~n~0_255, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_282|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_199|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [753] L59-2-->L49-2: Formula: (let ((.cse0 (* 2 (mod v_~n~0_325 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_539| 4294967296) .cse0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_82|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_82| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_538| (+ |v_thread1Thread1of1ForFork0_~i~0#1_539| 1)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_437| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335| (ite (and (< v_~x1~0_605 v_~size~0_322) (<= 0 v_~x1~0_605)) 1 0)) (= v_~x1~0_604 (select (select |v_#memory_int_444| v_~f~0.base_318) (+ v_~f~0.offset_318 (* v_~x1~0_605 4)))))) InVars {~size~0=v_~size~0_322, ~f~0.base=v_~f~0.base_318, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_539|, #memory_int=|v_#memory_int_444|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_437|, ~n~0=v_~n~0_325, ~x1~0=v_~x1~0_605, ~f~0.offset=v_~f~0.offset_318} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_353|, ~size~0=v_~size~0_322, ~f~0.base=v_~f~0.base_318, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_82|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_437|, ~x1~0=v_~x1~0_604, ~f~0.offset=v_~f~0.offset_318, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_82|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_538|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351|, #memory_int=|v_#memory_int_444|, ~n~0=v_~n~0_325, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_361|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:13,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [707] $Ultimate##0-->L49-2: Formula: (let ((.cse7 (select |v_#memory_int_369| v_~f~0.base_252))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_252 (* v_~x2~0_394 4))))) (let ((.cse1 (select .cse7 (+ v_~f~0.offset_252 (* .cse8 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_252 (* v_~x1~0_480 4)))) (.cse2 (select .cse7 (+ v_~f~0.offset_252 (* .cse1 4))))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_252 (* .cse2 4)))) (.cse0 (select .cse7 (+ v_~f~0.offset_252 (* .cse3 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_252 (* .cse0 4)))) (.cse4 (select .cse7 (+ (* .cse6 4) v_~f~0.offset_252)))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_256)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_272|) (not (= (ite (and (< .cse1 v_~size~0_256) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247| 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_330|) 4294967296) (* (mod v_~n~0_255 2147483648) 2)) (not (= (ite (and (< .cse2 v_~size~0_256) (<= 0 .cse2)) 1 0) 0)) (not (= 0 (ite (and (< v_~x2~0_394 v_~size~0_256) (<= 0 v_~x2~0_394)) 1 0))) (not (= (ite (and (< .cse3 v_~size~0_256) (<= 0 .cse3)) 1 0) 0)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_256)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|) (not (= (ite (and (<= 0 v_~x1~0_480) (< v_~x1~0_480 v_~size~0_256)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| (ite (and (< .cse5 v_~size~0_256) (<= 0 .cse5)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_272| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_256)) 1 0) 0)) (= v_~x1~0_478 (select .cse7 (+ v_~f~0.offset_252 (* .cse5 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_413| 4) (not (= (ite (and (< .cse8 v_~size~0_256) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_330|) (= (select .cse7 (+ v_~f~0.offset_252 (* .cse4 4))) v_~x2~0_393)))))))) InVars {~x2~0=v_~x2~0_394, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_252, #memory_int=|v_#memory_int_369|, ~n~0=v_~n~0_255, ~x1~0=v_~x1~0_480, ~f~0.offset=v_~f~0.offset_252} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_274|, ~x2~0=v_~x2~0_393, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_209|, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_252, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_213|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_330|, ~x1~0=v_~x1~0_478, ~f~0.offset=v_~f~0.offset_252, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_413|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_272|, #memory_int=|v_#memory_int_369|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_199|, ~n~0=v_~n~0_255, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_282|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_199|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [710] L59-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_373| v_~f~0.base_256))) (let ((.cse2 (* 2 (mod v_~n~0_259 2147483648))) (.cse1 (select .cse0 (+ v_~f~0.offset_256 (* v_~x2~0_398 4))))) (and (= (select .cse0 (+ v_~f~0.offset_256 (* .cse1 4))) v_~x2~0_397) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_333| 4294967296) .cse2) (= v_~x1~0_490 (select .cse0 (+ v_~f~0.offset_256 (* v_~x1~0_491 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280| 0)) (= (ite (and (< v_~x1~0_491 v_~size~0_260) (<= 0 v_~x1~0_491)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264|) (not (= (ite (and (< v_~x2~0_398 v_~size~0_260) (<= 0 v_~x2~0_398)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249|) (= |v_thread1Thread1of1ForFork0_~i~0#1_423| (+ |v_thread1Thread1of1ForFork0_~i~0#1_424| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_424| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| (ite (and (< .cse1 v_~size~0_260) (<= 0 .cse1)) 1 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_333|) |v_thread2Thread1of1ForFork1_~i~1#1_332|)))) InVars {~x2~0=v_~x2~0_398, ~size~0=v_~size~0_260, ~f~0.base=v_~f~0.base_256, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_424|, #memory_int=|v_#memory_int_373|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_333|, ~n~0=v_~n~0_259, ~x1~0=v_~x1~0_491, ~f~0.offset=v_~f~0.offset_256} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_282|, ~x2~0=v_~x2~0_397, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_211|, ~size~0=v_~size~0_260, ~f~0.base=v_~f~0.base_256, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_215|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_332|, ~x1~0=v_~x1~0_490, ~f~0.offset=v_~f~0.offset_256, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_423|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280|, #memory_int=|v_#memory_int_373|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_201|, ~n~0=v_~n~0_259, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_290|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_201|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:50:15,319 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 13:50:15,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7703 [2022-12-13 13:50:15,319 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 612 transitions, 22292 flow [2022-12-13 13:50:15,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:15,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:50:15,319 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:50:15,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 13:50:15,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:50:15,526 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:50:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:50:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1365195540, now seen corresponding path program 1 times [2022-12-13 13:50:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:50:15,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33627563] [2022-12-13 13:50:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:50:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:50:17,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33627563] [2022-12-13 13:50:17,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33627563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:50:17,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733394111] [2022-12-13 13:50:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:17,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:50:17,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:50:17,892 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:50:17,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 13:50:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:18,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 13:50:18,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:50:18,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:50:18,159 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 11 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 162 [2022-12-13 13:50:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:18,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:50:19,832 INFO L321 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2022-12-13 13:50:19,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 99 treesize of output 666 [2022-12-13 13:50:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:30,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733394111] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:50:30,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:50:30,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-13 13:50:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913547311] [2022-12-13 13:50:30,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:50:30,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:50:30,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:50:30,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:50:30,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:50:30,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 114 [2022-12-13 13:50:30,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 612 transitions, 22292 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:30,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:50:30,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 114 [2022-12-13 13:50:30,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:50:34,387 INFO L130 PetriNetUnfolder]: 2842/5348 cut-off events. [2022-12-13 13:50:34,387 INFO L131 PetriNetUnfolder]: For 715378/715378 co-relation queries the response was YES. [2022-12-13 13:50:34,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90979 conditions, 5348 events. 2842/5348 cut-off events. For 715378/715378 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 40224 event pairs, 1136 based on Foata normal form. 3/5333 useless extension candidates. Maximal degree in co-relation 90300. Up to 4675 conditions per place. [2022-12-13 13:50:34,507 INFO L137 encePairwiseOnDemand]: 54/114 looper letters, 519 selfloop transitions, 152 changer transitions 3/674 dead transitions. [2022-12-13 13:50:34,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 674 transitions, 25643 flow [2022-12-13 13:50:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:50:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:50:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2022-12-13 13:50:34,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1379585326953748 [2022-12-13 13:50:34,509 INFO L175 Difference]: Start difference. First operand has 389 places, 612 transitions, 22292 flow. Second operand 11 states and 173 transitions. [2022-12-13 13:50:34,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 674 transitions, 25643 flow [2022-12-13 13:50:39,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 674 transitions, 23003 flow, removed 1258 selfloop flow, removed 7 redundant places. [2022-12-13 13:50:39,137 INFO L231 Difference]: Finished difference. Result has 396 places, 633 transitions, 21366 flow [2022-12-13 13:50:39,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=19952, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21366, PETRI_PLACES=396, PETRI_TRANSITIONS=633} [2022-12-13 13:50:39,138 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 375 predicate places. [2022-12-13 13:50:39,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:50:39,138 INFO L89 Accepts]: Start accepts. Operand has 396 places, 633 transitions, 21366 flow [2022-12-13 13:50:39,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:50:39,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:50:39,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 396 places, 633 transitions, 21366 flow [2022-12-13 13:50:39,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 394 places, 633 transitions, 21366 flow [2022-12-13 13:50:39,688 INFO L130 PetriNetUnfolder]: 684/2078 cut-off events. [2022-12-13 13:50:39,688 INFO L131 PetriNetUnfolder]: For 295525/296009 co-relation queries the response was YES. [2022-12-13 13:50:39,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35837 conditions, 2078 events. 684/2078 cut-off events. For 295525/296009 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 19354 event pairs, 100 based on Foata normal form. 41/2063 useless extension candidates. Maximal degree in co-relation 35485. Up to 800 conditions per place. [2022-12-13 13:50:39,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 394 places, 633 transitions, 21366 flow [2022-12-13 13:50:39,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 1752 [2022-12-13 13:50:39,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [711] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_375| v_~f~0.base_258))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_258 (* v_~x2~0_403 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_258 (* .cse5 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_258 (* 4 .cse8)))) (.cse7 (select .cse0 (+ v_~f~0.offset_258 (* v_~x1~0_495 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_258 (* 4 .cse7)))) (.cse4 (select .cse0 (+ v_~f~0.offset_258 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_258 (* .cse4 4)))) (.cse2 (select .cse0 (+ (* .cse6 4) v_~f~0.offset_258)))) (and (= (select .cse0 (+ v_~f~0.offset_258 (* .cse1 4))) v_~x2~0_401) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| (ite (and (< .cse2 v_~size~0_262) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_262)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_227| (ite (and (< .cse1 v_~size~0_262) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_262)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_427| 4) (not (= (ite (and (< v_~x2~0_403 v_~size~0_262) (<= 0 v_~x2~0_403)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_336|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_282|) (not (= 0 (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_262)) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_282| 0)) (not (= (ite (and (< .cse6 v_~size~0_262) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_262)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_262)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_495) (< v_~x1~0_495 v_~size~0_262)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_251| 0)) (< 4 (* 2 (mod v_~n~0_261 2147483648))) (= (select .cse0 (+ v_~f~0.offset_258 (* .cse2 4))) v_~x1~0_494) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_227| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|)))))))) InVars {~x2~0=v_~x2~0_403, ~size~0=v_~size~0_262, ~f~0.base=v_~f~0.base_258, #memory_int=|v_#memory_int_375|, ~n~0=v_~n~0_261, ~x1~0=v_~x1~0_495, ~f~0.offset=v_~f~0.offset_258} OutVars{~x2~0=v_~x2~0_401, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_284|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_213|, ~size~0=v_~size~0_262, ~f~0.base=v_~f~0.base_258, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_217|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_227|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_336|, ~x1~0=v_~x1~0_494, ~f~0.offset=v_~f~0.offset_258, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_427|, #memory_int=|v_#memory_int_375|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_282|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_203|, ~n~0=v_~n~0_261, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_203|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_292|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:50:41,664 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:50:41,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2527 [2022-12-13 13:50:41,665 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 633 transitions, 21507 flow [2022-12-13 13:50:41,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:41,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:50:41,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:50:41,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 13:50:41,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:50:41,866 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:50:41,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:50:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1686682276, now seen corresponding path program 1 times [2022-12-13 13:50:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:50:41,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528983083] [2022-12-13 13:50:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:50:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:50:41,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:50:41,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528983083] [2022-12-13 13:50:41,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528983083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:50:41,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:50:41,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:50:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681867671] [2022-12-13 13:50:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:50:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:50:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:50:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:50:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:50:41,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 114 [2022-12-13 13:50:41,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 633 transitions, 21507 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:41,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:50:41,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 114 [2022-12-13 13:50:41,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:50:43,880 INFO L130 PetriNetUnfolder]: 2835/5327 cut-off events. [2022-12-13 13:50:43,880 INFO L131 PetriNetUnfolder]: For 672283/672283 co-relation queries the response was YES. [2022-12-13 13:50:43,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87392 conditions, 5327 events. 2835/5327 cut-off events. For 672283/672283 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 39918 event pairs, 1337 based on Foata normal form. 2/5311 useless extension candidates. Maximal degree in co-relation 86710. Up to 5311 conditions per place. [2022-12-13 13:50:43,965 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 619 selfloop transitions, 14 changer transitions 1/634 dead transitions. [2022-12-13 13:50:43,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 634 transitions, 22774 flow [2022-12-13 13:50:43,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:50:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:50:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-12-13 13:50:43,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.347953216374269 [2022-12-13 13:50:43,966 INFO L175 Difference]: Start difference. First operand has 394 places, 633 transitions, 21507 flow. Second operand 3 states and 119 transitions. [2022-12-13 13:50:43,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 634 transitions, 22774 flow [2022-12-13 13:50:47,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 634 transitions, 22293 flow, removed 193 selfloop flow, removed 5 redundant places. [2022-12-13 13:50:47,366 INFO L231 Difference]: Finished difference. Result has 390 places, 630 transitions, 20937 flow [2022-12-13 13:50:47,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=20965, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20937, PETRI_PLACES=390, PETRI_TRANSITIONS=630} [2022-12-13 13:50:47,367 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 369 predicate places. [2022-12-13 13:50:47,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:50:47,367 INFO L89 Accepts]: Start accepts. Operand has 390 places, 630 transitions, 20937 flow [2022-12-13 13:50:47,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:50:47,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:50:47,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 390 places, 630 transitions, 20937 flow [2022-12-13 13:50:47,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 630 transitions, 20937 flow [2022-12-13 13:50:47,871 INFO L130 PetriNetUnfolder]: 693/2081 cut-off events. [2022-12-13 13:50:47,871 INFO L131 PetriNetUnfolder]: For 283993/284482 co-relation queries the response was YES. [2022-12-13 13:50:47,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35068 conditions, 2081 events. 693/2081 cut-off events. For 283993/284482 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 19272 event pairs, 98 based on Foata normal form. 31/2055 useless extension candidates. Maximal degree in co-relation 34717. Up to 798 conditions per place. [2022-12-13 13:50:47,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 630 transitions, 20937 flow [2022-12-13 13:50:47,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 1746 [2022-12-13 13:50:47,922 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:50:47,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 555 [2022-12-13 13:50:47,922 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 630 transitions, 20937 flow [2022-12-13 13:50:47,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:47,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:50:47,922 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:50:47,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 13:50:47,922 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:50:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:50:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 611585812, now seen corresponding path program 1 times [2022-12-13 13:50:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:50:47,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435075774] [2022-12-13 13:50:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:50:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:47,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:50:47,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435075774] [2022-12-13 13:50:47,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435075774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:50:47,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354381924] [2022-12-13 13:50:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:47,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:50:47,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:50:47,972 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:50:47,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 13:50:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:48,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:50:48,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:50:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:48,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:50:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:48,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354381924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:50:48,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:50:48,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-12-13 13:50:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256487975] [2022-12-13 13:50:48,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:50:48,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:50:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:50:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:50:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:50:48,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 112 [2022-12-13 13:50:48,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 630 transitions, 20937 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:48,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:50:48,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 112 [2022-12-13 13:50:48,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:50:56,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:50:57,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:51:03,209 INFO L130 PetriNetUnfolder]: 2840/5288 cut-off events. [2022-12-13 13:51:03,210 INFO L131 PetriNetUnfolder]: For 740669/740669 co-relation queries the response was YES. [2022-12-13 13:51:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85745 conditions, 5288 events. 2840/5288 cut-off events. For 740669/740669 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 39874 event pairs, 389 based on Foata normal form. 166/5436 useless extension candidates. Maximal degree in co-relation 85064. Up to 2048 conditions per place. [2022-12-13 13:51:03,286 INFO L137 encePairwiseOnDemand]: 42/112 looper letters, 362 selfloop transitions, 416 changer transitions 20/798 dead transitions. [2022-12-13 13:51:03,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 798 transitions, 28044 flow [2022-12-13 13:51:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:51:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:51:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2022-12-13 13:51:03,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11538461538461539 [2022-12-13 13:51:03,288 INFO L175 Difference]: Start difference. First operand has 389 places, 630 transitions, 20937 flow. Second operand 13 states and 168 transitions. [2022-12-13 13:51:03,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 798 transitions, 28044 flow [2022-12-13 13:51:06,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 798 transitions, 27678 flow, removed 169 selfloop flow, removed 3 redundant places. [2022-12-13 13:51:06,406 INFO L231 Difference]: Finished difference. Result has 398 places, 651 transitions, 22355 flow [2022-12-13 13:51:06,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=20677, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=391, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=22355, PETRI_PLACES=398, PETRI_TRANSITIONS=651} [2022-12-13 13:51:06,406 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 377 predicate places. [2022-12-13 13:51:06,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:06,407 INFO L89 Accepts]: Start accepts. Operand has 398 places, 651 transitions, 22355 flow [2022-12-13 13:51:06,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:06,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:06,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 398 places, 651 transitions, 22355 flow [2022-12-13 13:51:06,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 651 transitions, 22355 flow [2022-12-13 13:51:06,913 INFO L130 PetriNetUnfolder]: 699/2024 cut-off events. [2022-12-13 13:51:06,913 INFO L131 PetriNetUnfolder]: For 273899/274357 co-relation queries the response was YES. [2022-12-13 13:51:06,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35271 conditions, 2024 events. 699/2024 cut-off events. For 273899/274357 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 18380 event pairs, 90 based on Foata normal form. 41/2015 useless extension candidates. Maximal degree in co-relation 34915. Up to 776 conditions per place. [2022-12-13 13:51:07,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 395 places, 651 transitions, 22355 flow [2022-12-13 13:51:07,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 1742 [2022-12-13 13:51:07,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_412| v_~f~0.base_286))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_286 (* v_~x2~0_461 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_286 (* v_~x1~0_581 4)))) (.cse6 (select .cse8 (+ v_~f~0.offset_286 (* .cse7 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_286 (* 4 .cse6)))) (.cse9 (select .cse8 (+ v_~f~0.offset_286 (* 4 .cse5))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_286 (* .cse9 4)))) (.cse0 (select .cse8 (+ v_~f~0.offset_286 (* 4 .cse4))))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_286 (* .cse0 4)))) (.cse2 (select .cse8 (+ v_~f~0.offset_286 (* .cse3 4))))) (and (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_379|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_290)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| (ite (and (< .cse1 v_~size~0_290) (<= 0 .cse1)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_289|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_289| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_323| (ite (and (< .cse2 v_~size~0_290) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_290)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_290) (<= 0 .cse4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_492| 5) (not (= (ite (and (< .cse5 v_~size~0_290) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_290)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_290)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_339| 0)) (not (= (ite (and (<= 0 v_~x2~0_461) (< v_~x2~0_461 v_~size~0_290)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_379|) 4294967296) (* (mod v_~n~0_289 2147483648) 2)) (= v_~x2~0_459 (select .cse8 (+ v_~f~0.offset_286 (* 4 .cse1)))) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_290)) 1 0) 0)) (= (select .cse8 (+ v_~f~0.offset_286 (* 4 .cse2))) v_~x1~0_580) (not (= (ite (and (<= 0 v_~x1~0_581) (< v_~x1~0_581 v_~size~0_290)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_323| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_339|)))))))) InVars {~x2~0=v_~x2~0_461, ~size~0=v_~size~0_290, ~f~0.base=v_~f~0.base_286, #memory_int=|v_#memory_int_412|, ~n~0=v_~n~0_289, ~x1~0=v_~x1~0_581, ~f~0.offset=v_~f~0.offset_286} OutVars{~x2~0=v_~x2~0_459, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_341|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_251|, ~size~0=v_~size~0_290, ~f~0.base=v_~f~0.base_286, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_255|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_379|, ~x1~0=v_~x1~0_580, ~f~0.offset=v_~f~0.offset_286, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_289|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_323|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_492|, #memory_int=|v_#memory_int_412|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_339|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_241|, ~n~0=v_~n~0_289, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_241|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_349|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:51:08,399 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:51:08,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1992 [2022-12-13 13:51:08,399 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 651 transitions, 22449 flow [2022-12-13 13:51:08,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:08,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:08,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:08,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 13:51:08,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 13:51:08,600 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:51:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash 377114647, now seen corresponding path program 1 times [2022-12-13 13:51:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:08,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30652818] [2022-12-13 13:51:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30652818] [2022-12-13 13:51:08,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30652818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:51:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392174137] [2022-12-13 13:51:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:51:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:51:08,648 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:51:08,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 13:51:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:08,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:51:08,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:51:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:08,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:51:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:08,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392174137] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:51:08,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:51:08,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 13:51:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344514140] [2022-12-13 13:51:08,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:51:08,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:51:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:51:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:51:08,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 111 [2022-12-13 13:51:08,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 651 transitions, 22449 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:08,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:08,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 111 [2022-12-13 13:51:08,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:11,120 INFO L130 PetriNetUnfolder]: 2841/5284 cut-off events. [2022-12-13 13:51:11,120 INFO L131 PetriNetUnfolder]: For 627030/627030 co-relation queries the response was YES. [2022-12-13 13:51:11,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86321 conditions, 5284 events. 2841/5284 cut-off events. For 627030/627030 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 39405 event pairs, 1232 based on Foata normal form. 4/5270 useless extension candidates. Maximal degree in co-relation 85624. Up to 4928 conditions per place. [2022-12-13 13:51:11,196 INFO L137 encePairwiseOnDemand]: 73/111 looper letters, 569 selfloop transitions, 109 changer transitions 1/679 dead transitions. [2022-12-13 13:51:11,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 679 transitions, 24779 flow [2022-12-13 13:51:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:51:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:51:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2022-12-13 13:51:11,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19519519519519518 [2022-12-13 13:51:11,197 INFO L175 Difference]: Start difference. First operand has 395 places, 651 transitions, 22449 flow. Second operand 6 states and 130 transitions. [2022-12-13 13:51:11,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 679 transitions, 24779 flow [2022-12-13 13:51:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 679 transitions, 24032 flow, removed 321 selfloop flow, removed 4 redundant places. [2022-12-13 13:51:14,061 INFO L231 Difference]: Finished difference. Result has 398 places, 655 transitions, 22256 flow [2022-12-13 13:51:14,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=21851, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22256, PETRI_PLACES=398, PETRI_TRANSITIONS=655} [2022-12-13 13:51:14,063 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 377 predicate places. [2022-12-13 13:51:14,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:14,063 INFO L89 Accepts]: Start accepts. Operand has 398 places, 655 transitions, 22256 flow [2022-12-13 13:51:14,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:14,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:14,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 398 places, 655 transitions, 22256 flow [2022-12-13 13:51:14,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 655 transitions, 22256 flow [2022-12-13 13:51:14,536 INFO L130 PetriNetUnfolder]: 709/2044 cut-off events. [2022-12-13 13:51:14,536 INFO L131 PetriNetUnfolder]: For 241406/241822 co-relation queries the response was YES. [2022-12-13 13:51:14,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34125 conditions, 2044 events. 709/2044 cut-off events. For 241406/241822 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 18549 event pairs, 89 based on Foata normal form. 31/2027 useless extension candidates. Maximal degree in co-relation 33770. Up to 777 conditions per place. [2022-12-13 13:51:14,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 655 transitions, 22256 flow [2022-12-13 13:51:14,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 1748 [2022-12-13 13:51:14,584 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:51:14,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-13 13:51:14,585 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 655 transitions, 22256 flow [2022-12-13 13:51:14,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:14,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:14,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:14,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 13:51:14,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-13 13:51:14,795 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:51:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1712067259, now seen corresponding path program 1 times [2022-12-13 13:51:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:14,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440313415] [2022-12-13 13:51:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:14,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:14,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440313415] [2022-12-13 13:51:14,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440313415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:51:14,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770537800] [2022-12-13 13:51:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:14,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:51:14,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:51:14,853 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:51:14,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 13:51:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:15,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:51:15,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:51:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:15,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:51:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:15,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770537800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:51:15,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:51:15,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 13:51:15,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174490422] [2022-12-13 13:51:15,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:51:15,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:51:15,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:15,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:51:15,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:51:15,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 13:51:15,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 655 transitions, 22256 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:15,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:15,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 13:51:15,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:18,085 INFO L130 PetriNetUnfolder]: 2917/5434 cut-off events. [2022-12-13 13:51:18,086 INFO L131 PetriNetUnfolder]: For 573877/573877 co-relation queries the response was YES. [2022-12-13 13:51:18,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86023 conditions, 5434 events. 2917/5434 cut-off events. For 573877/573877 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 40830 event pairs, 1179 based on Foata normal form. 12/5428 useless extension candidates. Maximal degree in co-relation 85327. Up to 4773 conditions per place. [2022-12-13 13:51:18,164 INFO L137 encePairwiseOnDemand]: 54/110 looper letters, 559 selfloop transitions, 171 changer transitions 2/732 dead transitions. [2022-12-13 13:51:18,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 732 transitions, 25713 flow [2022-12-13 13:51:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:51:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:51:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-12-13 13:51:18,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16090909090909092 [2022-12-13 13:51:18,166 INFO L175 Difference]: Start difference. First operand has 397 places, 655 transitions, 22256 flow. Second operand 10 states and 177 transitions. [2022-12-13 13:51:18,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 732 transitions, 25713 flow [2022-12-13 13:51:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 732 transitions, 25601 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 13:51:20,689 INFO L231 Difference]: Finished difference. Result has 411 places, 677 transitions, 23333 flow [2022-12-13 13:51:20,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=22146, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23333, PETRI_PLACES=411, PETRI_TRANSITIONS=677} [2022-12-13 13:51:20,689 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 390 predicate places. [2022-12-13 13:51:20,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:20,690 INFO L89 Accepts]: Start accepts. Operand has 411 places, 677 transitions, 23333 flow [2022-12-13 13:51:20,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:20,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:20,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 411 places, 677 transitions, 23333 flow [2022-12-13 13:51:20,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 411 places, 677 transitions, 23333 flow [2022-12-13 13:51:21,229 INFO L130 PetriNetUnfolder]: 721/2090 cut-off events. [2022-12-13 13:51:21,229 INFO L131 PetriNetUnfolder]: For 259570/260017 co-relation queries the response was YES. [2022-12-13 13:51:21,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35672 conditions, 2090 events. 721/2090 cut-off events. For 259570/260017 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 19155 event pairs, 90 based on Foata normal form. 31/2071 useless extension candidates. Maximal degree in co-relation 35309. Up to 804 conditions per place. [2022-12-13 13:51:21,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 411 places, 677 transitions, 23333 flow [2022-12-13 13:51:21,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 1800 [2022-12-13 13:51:21,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:51:22,094 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:51:22,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1406 [2022-12-13 13:51:22,095 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 677 transitions, 23441 flow [2022-12-13 13:51:22,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:22,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:22,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:22,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 13:51:22,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:51:22,301 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:51:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2092908037, now seen corresponding path program 2 times [2022-12-13 13:51:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:22,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902294714] [2022-12-13 13:51:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:22,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902294714] [2022-12-13 13:51:22,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902294714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:51:22,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:51:22,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:51:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373862009] [2022-12-13 13:51:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:51:22,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:51:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:51:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:51:22,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 112 [2022-12-13 13:51:22,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 677 transitions, 23441 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:22,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:22,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 112 [2022-12-13 13:51:22,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:24,884 INFO L130 PetriNetUnfolder]: 2921/5490 cut-off events. [2022-12-13 13:51:24,884 INFO L131 PetriNetUnfolder]: For 597380/597380 co-relation queries the response was YES. [2022-12-13 13:51:24,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87743 conditions, 5490 events. 2921/5490 cut-off events. For 597380/597380 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 41684 event pairs, 1208 based on Foata normal form. 8/5480 useless extension candidates. Maximal degree in co-relation 87036. Up to 4777 conditions per place. [2022-12-13 13:51:25,044 INFO L137 encePairwiseOnDemand]: 87/112 looper letters, 666 selfloop transitions, 72 changer transitions 5/743 dead transitions. [2022-12-13 13:51:25,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 743 transitions, 26991 flow [2022-12-13 13:51:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:51:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:51:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-12-13 13:51:25,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29464285714285715 [2022-12-13 13:51:25,045 INFO L175 Difference]: Start difference. First operand has 411 places, 677 transitions, 23441 flow. Second operand 4 states and 132 transitions. [2022-12-13 13:51:25,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 743 transitions, 26991 flow [2022-12-13 13:51:27,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 743 transitions, 26523 flow, removed 149 selfloop flow, removed 1 redundant places. [2022-12-13 13:51:27,931 INFO L231 Difference]: Finished difference. Result has 415 places, 700 transitions, 23940 flow [2022-12-13 13:51:27,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=23005, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=23940, PETRI_PLACES=415, PETRI_TRANSITIONS=700} [2022-12-13 13:51:27,932 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 394 predicate places. [2022-12-13 13:51:27,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:27,932 INFO L89 Accepts]: Start accepts. Operand has 415 places, 700 transitions, 23940 flow [2022-12-13 13:51:27,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:27,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:27,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 700 transitions, 23940 flow [2022-12-13 13:51:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 415 places, 700 transitions, 23940 flow [2022-12-13 13:51:28,459 INFO L130 PetriNetUnfolder]: 726/2136 cut-off events. [2022-12-13 13:51:28,459 INFO L131 PetriNetUnfolder]: For 264937/265349 co-relation queries the response was YES. [2022-12-13 13:51:28,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36386 conditions, 2136 events. 726/2136 cut-off events. For 264937/265349 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 19759 event pairs, 87 based on Foata normal form. 31/2123 useless extension candidates. Maximal degree in co-relation 36020. Up to 802 conditions per place. [2022-12-13 13:51:28,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 415 places, 700 transitions, 23940 flow [2022-12-13 13:51:28,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 1820 [2022-12-13 13:51:28,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [788] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_490| v_~f~0.base_362))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_362 (* v_~x1~0_727 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_362 (* v_~x2~0_598 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_362 (* .cse9 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_362 (* 4 .cse7)))) (.cse3 (select .cse1 (+ (* .cse10 4) v_~f~0.offset_362)))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_362 (* .cse3 4)))) (.cse6 (select .cse1 (+ (* .cse8 4) v_~f~0.offset_362)))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_362 (* .cse6 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_362 (* .cse4 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_366)) 1 0) 0)) (< 5 (* (mod v_~n~0_369 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368| 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_505|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|) (not (= (ite (and (< v_~x1~0_727 v_~size~0_366) (<= 0 v_~x1~0_727)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426| 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse2 4))) v_~x1~0_725) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410| (ite (and (< .cse2 v_~size~0_366) (<= 0 .cse2)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_366) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_366)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_366)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_366) (<= 0 .cse6)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse5 4))) v_~x2~0_597) (not (= (ite (and (< .cse7 v_~size~0_366) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_646| 6) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_366)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_598) (< v_~x2~0_598 v_~size~0_366)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|) (not (= (ite (and (< .cse9 v_~size~0_366) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_366) (<= 0 .cse10)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_598, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_362, #memory_int=|v_#memory_int_490|, ~n~0=v_~n~0_369, ~x1~0=v_~x1~0_727, ~f~0.offset=v_~f~0.offset_362} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_428|, ~x2~0=v_~x2~0_597, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_330|, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_362, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_334|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_505|, ~x1~0=v_~x1~0_725, ~f~0.offset=v_~f~0.offset_362, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_646|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|, #memory_int=|v_#memory_int_490|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_320|, ~n~0=v_~n~0_369, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_436|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_320|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [793] L59-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_496| v_~f~0.base_368))) (let ((.cse0 (* (mod v_~n~0_375 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_368 (* v_~x2~0_615 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_615) (< v_~x2~0_615 v_~size~0_372)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_439| 0)) (= (ite (and (<= 0 v_~x1~0_745) (< v_~x1~0_745 v_~size~0_372)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_423|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_661| 4294967296) .cse0) (= v_~x1~0_744 (select .cse1 (+ v_~f~0.offset_368 (* v_~x1~0_745 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_516| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_517|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_423| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_439|) (= |v_thread1Thread1of1ForFork0_~i~0#1_660| (+ |v_thread1Thread1of1ForFork0_~i~0#1_661| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355| (ite (and (< .cse2 v_~size~0_372) (<= 0 .cse2)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_517| 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_368 (* .cse2 4))) v_~x2~0_614) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379| 0))))) InVars {~x2~0=v_~x2~0_615, ~size~0=v_~size~0_372, ~f~0.base=v_~f~0.base_368, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_661|, #memory_int=|v_#memory_int_496|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_517|, ~n~0=v_~n~0_375, ~x1~0=v_~x1~0_745, ~f~0.offset=v_~f~0.offset_368} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_441|, ~x2~0=v_~x2~0_614, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_341|, ~size~0=v_~size~0_372, ~f~0.base=v_~f~0.base_368, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_345|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_516|, ~x1~0=v_~x1~0_744, ~f~0.offset=v_~f~0.offset_368, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_423|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_660|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_439|, #memory_int=|v_#memory_int_496|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_331|, ~n~0=v_~n~0_375, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_449|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_331|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:51:29,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [788] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_490| v_~f~0.base_362))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_362 (* v_~x1~0_727 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_362 (* v_~x2~0_598 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_362 (* .cse9 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_362 (* 4 .cse7)))) (.cse3 (select .cse1 (+ (* .cse10 4) v_~f~0.offset_362)))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_362 (* .cse3 4)))) (.cse6 (select .cse1 (+ (* .cse8 4) v_~f~0.offset_362)))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_362 (* .cse6 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_362 (* .cse4 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_366)) 1 0) 0)) (< 5 (* (mod v_~n~0_369 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368| 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_505|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|) (not (= (ite (and (< v_~x1~0_727 v_~size~0_366) (<= 0 v_~x1~0_727)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426| 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse2 4))) v_~x1~0_725) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410| (ite (and (< .cse2 v_~size~0_366) (<= 0 .cse2)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_366) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_366)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_366)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_366) (<= 0 .cse6)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse5 4))) v_~x2~0_597) (not (= (ite (and (< .cse7 v_~size~0_366) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_646| 6) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_366)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_598) (< v_~x2~0_598 v_~size~0_366)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|) (not (= (ite (and (< .cse9 v_~size~0_366) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_366) (<= 0 .cse10)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_598, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_362, #memory_int=|v_#memory_int_490|, ~n~0=v_~n~0_369, ~x1~0=v_~x1~0_727, ~f~0.offset=v_~f~0.offset_362} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_428|, ~x2~0=v_~x2~0_597, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_330|, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_362, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_334|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_505|, ~x1~0=v_~x1~0_725, ~f~0.offset=v_~f~0.offset_362, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_410|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_646|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_426|, #memory_int=|v_#memory_int_490|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_320|, ~n~0=v_~n~0_369, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_436|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_320|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:51:30,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_235| v_~f~0.base_144))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_212 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648))) (.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_157 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x1~0_211) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_166| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_150)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4))) v_~x2~0_156) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_121|) |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= (ite (and (< v_~x1~0_212 v_~size~0_150) (<= 0 v_~x1~0_212)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_121| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_165| 4294967295) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= |v_thread1Thread1of1ForFork0_~i~0#1_165| (+ |v_thread1Thread1of1ForFork0_~i~0#1_166| 2)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|)))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, #memory_int=|v_#memory_int_235|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_144} OutVars{~x2~0=v_~x2~0_156, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_113|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_211, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_165|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_121|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:51:30,889 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_235| v_~f~0.base_144))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_212 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648))) (.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_157 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x1~0_211) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_166| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_150)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4))) v_~x2~0_156) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_121|) |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= (ite (and (< v_~x1~0_212 v_~size~0_150) (<= 0 v_~x1~0_212)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_121| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_165| 4294967295) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= |v_thread1Thread1of1ForFork0_~i~0#1_165| (+ |v_thread1Thread1of1ForFork0_~i~0#1_166| 2)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|)))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, #memory_int=|v_#memory_int_235|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_144} OutVars{~x2~0=v_~x2~0_156, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_113|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_211, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_165|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_121|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) (+ v_~f~0.offset_In_5 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:51:31,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_235| v_~f~0.base_144))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_212 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648))) (.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_157 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x1~0_211) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_166| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_150)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4))) v_~x2~0_156) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_121|) |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= (ite (and (< v_~x1~0_212 v_~size~0_150) (<= 0 v_~x1~0_212)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_121| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_165| 4294967295) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= |v_thread1Thread1of1ForFork0_~i~0#1_165| (+ |v_thread1Thread1of1ForFork0_~i~0#1_166| 2)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|)))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, #memory_int=|v_#memory_int_235|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_144} OutVars{~x2~0=v_~x2~0_156, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_113|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_211, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_165|, #memory_int=|v_#memory_int_235|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_121|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [716] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_383| v_~f~0.base_264))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_264 (* v_~x1~0_514 4))))) (let ((.cse3 (select .cse4 (+ (* .cse1 4) v_~f~0.offset_264)))) (let ((.cse0 (* (mod v_~n~0_267 2147483648) 2)) (.cse2 (select .cse4 (+ v_~f~0.offset_264 (* .cse3 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_442| 3) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< .cse1 v_~size~0_268) (<= 0 .cse1)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_268)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277|) (= |v_thread1Thread1of1ForFork0_~i~0#1_440| (+ |v_thread1Thread1of1ForFork0_~i~0#1_442| 4)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_268)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_514) (< v_~x1~0_514 v_~size~0_268)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_442| 2) 4294967296) .cse0) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_442| 4294967296) .cse0) (= v_~x1~0_512 (select .cse4 (+ v_~f~0.offset_264 (* .cse2 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_293| 0))))))) InVars {~size~0=v_~size~0_268, ~f~0.base=v_~f~0.base_264, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_442|, #memory_int=|v_#memory_int_383|, ~n~0=v_~n~0_267, ~x1~0=v_~x1~0_514, ~f~0.offset=v_~f~0.offset_264} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_295|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277|, ~size~0=v_~size~0_268, ~f~0.base=v_~f~0.base_264, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_440|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_293|, #memory_int=|v_#memory_int_383|, ~n~0=v_~n~0_267, ~x1~0=v_~x1~0_512, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_303|, ~f~0.offset=v_~f~0.offset_264} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 13:51:32,661 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:51:32,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4729 [2022-12-13 13:51:32,661 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 700 transitions, 24149 flow [2022-12-13 13:51:32,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:32,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:32,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:32,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 13:51:32,662 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:51:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1638690411, now seen corresponding path program 1 times [2022-12-13 13:51:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:32,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716311600] [2022-12-13 13:51:32,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:32,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:51:32,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:32,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716311600] [2022-12-13 13:51:32,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716311600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:51:32,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:51:32,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:51:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379762] [2022-12-13 13:51:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:51:32,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:51:32,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:51:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:51:32,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-13 13:51:32,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 700 transitions, 24149 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:32,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:32,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-13 13:51:32,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:34,910 INFO L130 PetriNetUnfolder]: 2942/5518 cut-off events. [2022-12-13 13:51:34,910 INFO L131 PetriNetUnfolder]: For 624309/624309 co-relation queries the response was YES. [2022-12-13 13:51:34,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89449 conditions, 5518 events. 2942/5518 cut-off events. For 624309/624309 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 41919 event pairs, 1352 based on Foata normal form. 10/5510 useless extension candidates. Maximal degree in co-relation 88736. Up to 5409 conditions per place. [2022-12-13 13:51:34,989 INFO L137 encePairwiseOnDemand]: 105/116 looper letters, 695 selfloop transitions, 20 changer transitions 0/715 dead transitions. [2022-12-13 13:51:34,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 715 transitions, 26074 flow [2022-12-13 13:51:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:51:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:51:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-12-13 13:51:34,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35344827586206895 [2022-12-13 13:51:34,990 INFO L175 Difference]: Start difference. First operand has 415 places, 700 transitions, 24149 flow. Second operand 3 states and 123 transitions. [2022-12-13 13:51:34,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 715 transitions, 26074 flow [2022-12-13 13:51:38,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 715 transitions, 25823 flow, removed 80 selfloop flow, removed 3 redundant places. [2022-12-13 13:51:38,066 INFO L231 Difference]: Finished difference. Result has 415 places, 704 transitions, 24143 flow [2022-12-13 13:51:38,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=23899, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=24143, PETRI_PLACES=415, PETRI_TRANSITIONS=704} [2022-12-13 13:51:38,066 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 394 predicate places. [2022-12-13 13:51:38,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:38,066 INFO L89 Accepts]: Start accepts. Operand has 415 places, 704 transitions, 24143 flow [2022-12-13 13:51:38,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:38,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:38,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 704 transitions, 24143 flow [2022-12-13 13:51:38,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 415 places, 704 transitions, 24143 flow [2022-12-13 13:51:38,601 INFO L130 PetriNetUnfolder]: 738/2169 cut-off events. [2022-12-13 13:51:38,602 INFO L131 PetriNetUnfolder]: For 270987/271454 co-relation queries the response was YES. [2022-12-13 13:51:38,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36794 conditions, 2169 events. 738/2169 cut-off events. For 270987/271454 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 20073 event pairs, 87 based on Foata normal form. 31/2153 useless extension candidates. Maximal degree in co-relation 36430. Up to 811 conditions per place. [2022-12-13 13:51:38,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 415 places, 704 transitions, 24143 flow [2022-12-13 13:51:38,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 1842 [2022-12-13 13:51:38,651 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:51:38,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 585 [2022-12-13 13:51:38,651 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 704 transitions, 24143 flow [2022-12-13 13:51:38,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:38,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:38,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:38,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 13:51:38,651 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:51:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash 933019864, now seen corresponding path program 1 times [2022-12-13 13:51:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:38,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382717202] [2022-12-13 13:51:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:51:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:38,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382717202] [2022-12-13 13:51:38,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382717202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:51:38,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:51:38,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:51:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289809633] [2022-12-13 13:51:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:51:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:51:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:38,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:51:38,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:51:38,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-13 13:51:38,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 704 transitions, 24143 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:38,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:38,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-13 13:51:38,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:41,167 INFO L130 PetriNetUnfolder]: 2939/5513 cut-off events. [2022-12-13 13:51:41,168 INFO L131 PetriNetUnfolder]: For 617007/617007 co-relation queries the response was YES. [2022-12-13 13:51:41,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88524 conditions, 5513 events. 2939/5513 cut-off events. For 617007/617007 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 41883 event pairs, 1366 based on Foata normal form. 2/5497 useless extension candidates. Maximal degree in co-relation 87816. Up to 5482 conditions per place. [2022-12-13 13:51:41,251 INFO L137 encePairwiseOnDemand]: 97/116 looper letters, 679 selfloop transitions, 28 changer transitions 0/707 dead transitions. [2022-12-13 13:51:41,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 707 transitions, 25585 flow [2022-12-13 13:51:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:51:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:51:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-12-13 13:51:41,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26939655172413796 [2022-12-13 13:51:41,253 INFO L175 Difference]: Start difference. First operand has 415 places, 704 transitions, 24143 flow. Second operand 4 states and 125 transitions. [2022-12-13 13:51:41,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 707 transitions, 25585 flow [2022-12-13 13:51:44,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 707 transitions, 25519 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-12-13 13:51:44,144 INFO L231 Difference]: Finished difference. Result has 417 places, 704 transitions, 24151 flow [2022-12-13 13:51:44,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=24077, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=24151, PETRI_PLACES=417, PETRI_TRANSITIONS=704} [2022-12-13 13:51:44,145 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 396 predicate places. [2022-12-13 13:51:44,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:44,145 INFO L89 Accepts]: Start accepts. Operand has 417 places, 704 transitions, 24151 flow [2022-12-13 13:51:44,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:44,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:44,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 417 places, 704 transitions, 24151 flow [2022-12-13 13:51:44,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 417 places, 704 transitions, 24151 flow [2022-12-13 13:51:44,670 INFO L130 PetriNetUnfolder]: 737/2165 cut-off events. [2022-12-13 13:51:44,670 INFO L131 PetriNetUnfolder]: For 268129/268577 co-relation queries the response was YES. [2022-12-13 13:51:44,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36650 conditions, 2165 events. 737/2165 cut-off events. For 268129/268577 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 20063 event pairs, 87 based on Foata normal form. 31/2151 useless extension candidates. Maximal degree in co-relation 36286. Up to 810 conditions per place. [2022-12-13 13:51:44,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 417 places, 704 transitions, 24151 flow [2022-12-13 13:51:44,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-13 13:51:44,719 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:51:44,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 575 [2022-12-13 13:51:44,720 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 704 transitions, 24151 flow [2022-12-13 13:51:44,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:44,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:44,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:44,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 13:51:44,720 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:51:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash 938088462, now seen corresponding path program 2 times [2022-12-13 13:51:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:44,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306754194] [2022-12-13 13:51:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:44,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:44,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306754194] [2022-12-13 13:51:44,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306754194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:51:44,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605142766] [2022-12-13 13:51:44,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:51:44,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:51:44,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:51:44,809 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:51:44,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 13:51:44,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 13:51:44,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:51:44,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:51:44,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:51:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:51:45,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:51:45,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605142766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:51:45,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:51:45,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 13:51:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290009408] [2022-12-13 13:51:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:51:45,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:51:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:45,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:51:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:51:45,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-13 13:51:45,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 704 transitions, 24151 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:45,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:45,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-13 13:51:45,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:47,599 INFO L130 PetriNetUnfolder]: 2950/5532 cut-off events. [2022-12-13 13:51:47,599 INFO L131 PetriNetUnfolder]: For 617427/617427 co-relation queries the response was YES. [2022-12-13 13:51:47,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88701 conditions, 5532 events. 2950/5532 cut-off events. For 617427/617427 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 41998 event pairs, 1352 based on Foata normal form. 8/5522 useless extension candidates. Maximal degree in co-relation 87993. Up to 5433 conditions per place. [2022-12-13 13:51:47,680 INFO L137 encePairwiseOnDemand]: 96/116 looper letters, 683 selfloop transitions, 31 changer transitions 0/714 dead transitions. [2022-12-13 13:51:47,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 714 transitions, 25849 flow [2022-12-13 13:51:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:51:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:51:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-13 13:51:47,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2022-12-13 13:51:47,681 INFO L175 Difference]: Start difference. First operand has 417 places, 704 transitions, 24151 flow. Second operand 4 states and 128 transitions. [2022-12-13 13:51:47,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 714 transitions, 25849 flow [2022-12-13 13:51:50,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 714 transitions, 25799 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 13:51:50,448 INFO L231 Difference]: Finished difference. Result has 419 places, 705 transitions, 24235 flow [2022-12-13 13:51:50,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=24101, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=24235, PETRI_PLACES=419, PETRI_TRANSITIONS=705} [2022-12-13 13:51:50,449 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 398 predicate places. [2022-12-13 13:51:50,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:51:50,449 INFO L89 Accepts]: Start accepts. Operand has 419 places, 705 transitions, 24235 flow [2022-12-13 13:51:50,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:51:50,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:51:50,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 705 transitions, 24235 flow [2022-12-13 13:51:50,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 419 places, 705 transitions, 24235 flow [2022-12-13 13:51:50,958 INFO L130 PetriNetUnfolder]: 740/2176 cut-off events. [2022-12-13 13:51:50,958 INFO L131 PetriNetUnfolder]: For 271911/272384 co-relation queries the response was YES. [2022-12-13 13:51:51,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36953 conditions, 2176 events. 740/2176 cut-off events. For 271911/272384 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 20169 event pairs, 87 based on Foata normal form. 31/2160 useless extension candidates. Maximal degree in co-relation 36588. Up to 812 conditions per place. [2022-12-13 13:51:51,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 705 transitions, 24235 flow [2022-12-13 13:51:51,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 1846 [2022-12-13 13:51:51,075 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:51:51,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 626 [2022-12-13 13:51:51,075 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 705 transitions, 24235 flow [2022-12-13 13:51:51,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:51,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:51,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:51,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 13:51:51,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-12-13 13:51:51,281 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:51:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 656375505, now seen corresponding path program 1 times [2022-12-13 13:51:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:51,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221138664] [2022-12-13 13:51:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221138664] [2022-12-13 13:51:52,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221138664] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:51:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447585854] [2022-12-13 13:51:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:52,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:51:52,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:51:52,373 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:51:52,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 13:51:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:52,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:51:52,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:51:52,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:51:52,558 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 14 treesize of output 16 [2022-12-13 13:51:52,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:51:52,623 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 13:51:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:52,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:51:52,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:51:52,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 13:51:52,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:51:52,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 13:51:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:57,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447585854] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:51:57,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:51:57,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:51:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651566720] [2022-12-13 13:51:57,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:51:57,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:51:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:51:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:51:57,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-13 13:51:57,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 705 transitions, 24235 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:51:57,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:57,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-13 13:51:57,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:52:00,721 INFO L130 PetriNetUnfolder]: 3094/5790 cut-off events. [2022-12-13 13:52:00,721 INFO L131 PetriNetUnfolder]: For 677207/677207 co-relation queries the response was YES. [2022-12-13 13:52:00,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93872 conditions, 5790 events. 3094/5790 cut-off events. For 677207/677207 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 44378 event pairs, 1211 based on Foata normal form. 1/5773 useless extension candidates. Maximal degree in co-relation 93163. Up to 5189 conditions per place. [2022-12-13 13:52:00,807 INFO L137 encePairwiseOnDemand]: 40/116 looper letters, 585 selfloop transitions, 199 changer transitions 6/790 dead transitions. [2022-12-13 13:52:00,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 790 transitions, 28210 flow [2022-12-13 13:52:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:52:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:52:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions. [2022-12-13 13:52:00,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12931034482758622 [2022-12-13 13:52:00,808 INFO L175 Difference]: Start difference. First operand has 419 places, 705 transitions, 24235 flow. Second operand 12 states and 180 transitions. [2022-12-13 13:52:00,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 790 transitions, 28210 flow [2022-12-13 13:52:03,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 790 transitions, 28119 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 13:52:03,854 INFO L231 Difference]: Finished difference. Result has 430 places, 747 transitions, 26478 flow [2022-12-13 13:52:03,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=24158, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26478, PETRI_PLACES=430, PETRI_TRANSITIONS=747} [2022-12-13 13:52:03,858 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 409 predicate places. [2022-12-13 13:52:03,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:52:03,858 INFO L89 Accepts]: Start accepts. Operand has 430 places, 747 transitions, 26478 flow [2022-12-13 13:52:03,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:52:03,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:52:03,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 747 transitions, 26478 flow [2022-12-13 13:52:03,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 747 transitions, 26478 flow [2022-12-13 13:52:04,399 INFO L130 PetriNetUnfolder]: 773/2264 cut-off events. [2022-12-13 13:52:04,400 INFO L131 PetriNetUnfolder]: For 291417/291906 co-relation queries the response was YES. [2022-12-13 13:52:04,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39184 conditions, 2264 events. 773/2264 cut-off events. For 291417/291906 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 21188 event pairs, 91 based on Foata normal form. 31/2248 useless extension candidates. Maximal degree in co-relation 38817. Up to 858 conditions per place. [2022-12-13 13:52:04,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 747 transitions, 26478 flow [2022-12-13 13:52:04,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 1958 [2022-12-13 13:52:04,451 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:52:04,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 593 [2022-12-13 13:52:04,451 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 747 transitions, 26478 flow [2022-12-13 13:52:04,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:04,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:52:04,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:52:04,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-13 13:52:04,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:52:04,657 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:52:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:52:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash 820126278, now seen corresponding path program 1 times [2022-12-13 13:52:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:52:04,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658367086] [2022-12-13 13:52:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:04,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:52:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:07,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:52:07,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658367086] [2022-12-13 13:52:07,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658367086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:52:07,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506132236] [2022-12-13 13:52:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:52:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:52:07,767 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:52:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 13:52:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:07,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 13:52:07,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:52:07,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:52:07,950 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 38 treesize of output 34 [2022-12-13 13:52:08,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:52:08,016 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 76 [2022-12-13 13:52:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:08,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:52:08,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:52:08,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 364 [2022-12-13 13:52:08,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:52:08,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 116 [2022-12-13 13:52:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:10,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506132236] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:52:10,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:52:10,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:52:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288017072] [2022-12-13 13:52:10,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:52:10,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:52:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:52:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:52:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=168, Unknown=3, NotChecked=0, Total=210 [2022-12-13 13:52:10,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-13 13:52:10,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 747 transitions, 26478 flow. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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-13 13:52:10,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:52:10,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-13 13:52:10,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:52:15,567 INFO L130 PetriNetUnfolder]: 3128/5851 cut-off events. [2022-12-13 13:52:15,567 INFO L131 PetriNetUnfolder]: For 681978/681978 co-relation queries the response was YES. [2022-12-13 13:52:15,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95820 conditions, 5851 events. 3128/5851 cut-off events. For 681978/681978 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 44923 event pairs, 649 based on Foata normal form. 1/5834 useless extension candidates. Maximal degree in co-relation 94635. Up to 5151 conditions per place. [2022-12-13 13:52:15,652 INFO L137 encePairwiseOnDemand]: 42/116 looper letters, 636 selfloop transitions, 163 changer transitions 14/813 dead transitions. [2022-12-13 13:52:15,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 813 transitions, 29536 flow [2022-12-13 13:52:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:52:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:52:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2022-12-13 13:52:15,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14295977011494254 [2022-12-13 13:52:15,654 INFO L175 Difference]: Start difference. First operand has 430 places, 747 transitions, 26478 flow. Second operand 12 states and 199 transitions. [2022-12-13 13:52:15,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 813 transitions, 29536 flow [2022-12-13 13:52:18,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 813 transitions, 29126 flow, removed 161 selfloop flow, removed 4 redundant places. [2022-12-13 13:52:18,923 INFO L231 Difference]: Finished difference. Result has 441 places, 756 transitions, 26972 flow [2022-12-13 13:52:18,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=26068, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26972, PETRI_PLACES=441, PETRI_TRANSITIONS=756} [2022-12-13 13:52:18,924 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 420 predicate places. [2022-12-13 13:52:18,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:52:18,924 INFO L89 Accepts]: Start accepts. Operand has 441 places, 756 transitions, 26972 flow [2022-12-13 13:52:18,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:52:18,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:52:18,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 441 places, 756 transitions, 26972 flow [2022-12-13 13:52:18,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 441 places, 756 transitions, 26972 flow [2022-12-13 13:52:19,492 INFO L130 PetriNetUnfolder]: 782/2292 cut-off events. [2022-12-13 13:52:19,492 INFO L131 PetriNetUnfolder]: For 295522/295996 co-relation queries the response was YES. [2022-12-13 13:52:19,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39836 conditions, 2292 events. 782/2292 cut-off events. For 295522/295996 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 21636 event pairs, 93 based on Foata normal form. 34/2278 useless extension candidates. Maximal degree in co-relation 39402. Up to 870 conditions per place. [2022-12-13 13:52:19,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 441 places, 756 transitions, 26972 flow [2022-12-13 13:52:19,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-13 13:52:19,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:52:19,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 810 [2022-12-13 13:52:19,734 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 756 transitions, 27027 flow [2022-12-13 13:52:19,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 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-13 13:52:19,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:52:19,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:52:19,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 13:52:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-13 13:52:19,935 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:52:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:52:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1595993351, now seen corresponding path program 1 times [2022-12-13 13:52:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:52:19,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621708561] [2022-12-13 13:52:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:52:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:52:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621708561] [2022-12-13 13:52:20,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621708561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:52:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800050870] [2022-12-13 13:52:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:20,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:52:20,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:52:20,943 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:52:20,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 13:52:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:21,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 13:52:21,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:52:21,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:52:21,162 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 30 treesize of output 28 [2022-12-13 13:52:21,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:52:21,226 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 13:52:21,250 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-13 13:52:21,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:52:21,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:52:21,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 13:52:21,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:52:21,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 13:52:24,284 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-13 13:52:24,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800050870] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:52:24,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:52:24,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 13:52:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472015767] [2022-12-13 13:52:24,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:52:24,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:52:24,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:52:24,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:52:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:52:24,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 117 [2022-12-13 13:52:24,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 756 transitions, 27027 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:24,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:52:24,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 117 [2022-12-13 13:52:24,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:52:27,543 INFO L130 PetriNetUnfolder]: 3166/5907 cut-off events. [2022-12-13 13:52:27,543 INFO L131 PetriNetUnfolder]: For 696867/696867 co-relation queries the response was YES. [2022-12-13 13:52:27,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97541 conditions, 5907 events. 3166/5907 cut-off events. For 696867/696867 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 45369 event pairs, 886 based on Foata normal form. 2/5889 useless extension candidates. Maximal degree in co-relation 96657. Up to 5161 conditions per place. [2022-12-13 13:52:27,634 INFO L137 encePairwiseOnDemand]: 36/117 looper letters, 600 selfloop transitions, 203 changer transitions 16/819 dead transitions. [2022-12-13 13:52:27,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 819 transitions, 30288 flow [2022-12-13 13:52:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:52:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:52:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2022-12-13 13:52:27,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14996114996114995 [2022-12-13 13:52:27,648 INFO L175 Difference]: Start difference. First operand has 441 places, 756 transitions, 27027 flow. Second operand 11 states and 193 transitions. [2022-12-13 13:52:27,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 819 transitions, 30288 flow [2022-12-13 13:52:31,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 819 transitions, 29911 flow, removed 134 selfloop flow, removed 5 redundant places. [2022-12-13 13:52:31,122 INFO L231 Difference]: Finished difference. Result has 450 places, 770 transitions, 28047 flow [2022-12-13 13:52:31,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=26684, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=28047, PETRI_PLACES=450, PETRI_TRANSITIONS=770} [2022-12-13 13:52:31,123 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 429 predicate places. [2022-12-13 13:52:31,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:52:31,123 INFO L89 Accepts]: Start accepts. Operand has 450 places, 770 transitions, 28047 flow [2022-12-13 13:52:31,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:52:31,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:52:31,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 450 places, 770 transitions, 28047 flow [2022-12-13 13:52:31,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 449 places, 770 transitions, 28047 flow [2022-12-13 13:52:31,750 INFO L130 PetriNetUnfolder]: 793/2276 cut-off events. [2022-12-13 13:52:31,751 INFO L131 PetriNetUnfolder]: For 300159/300618 co-relation queries the response was YES. [2022-12-13 13:52:31,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40495 conditions, 2276 events. 793/2276 cut-off events. For 300159/300618 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 21183 event pairs, 99 based on Foata normal form. 30/2260 useless extension candidates. Maximal degree in co-relation 40055. Up to 872 conditions per place. [2022-12-13 13:52:31,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 449 places, 770 transitions, 28047 flow [2022-12-13 13:52:31,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 2020 [2022-12-13 13:52:31,802 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:52:31,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 680 [2022-12-13 13:52:31,803 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 770 transitions, 28047 flow [2022-12-13 13:52:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:31,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:52:31,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:52:31,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-13 13:52:32,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:52:32,009 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:52:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:52:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 46779400, now seen corresponding path program 1 times [2022-12-13 13:52:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:52:32,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911154857] [2022-12-13 13:52:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:52:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:32,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:52:32,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911154857] [2022-12-13 13:52:32,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911154857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:52:32,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734731738] [2022-12-13 13:52:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:32,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:52:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:52:32,074 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:52:32,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 13:52:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:32,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:52:32,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:52:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:32,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:52:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:32,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734731738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:52:32,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:52:32,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:52:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540520178] [2022-12-13 13:52:32,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:52:32,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:52:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:52:32,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:52:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:52:32,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 114 [2022-12-13 13:52:32,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 770 transitions, 28047 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:32,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:52:32,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 114 [2022-12-13 13:52:32,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:52:35,373 INFO L130 PetriNetUnfolder]: 3161/5875 cut-off events. [2022-12-13 13:52:35,373 INFO L131 PetriNetUnfolder]: For 715656/715656 co-relation queries the response was YES. [2022-12-13 13:52:35,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98488 conditions, 5875 events. 3161/5875 cut-off events. For 715656/715656 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 44676 event pairs, 1366 based on Foata normal form. 30/5895 useless extension candidates. Maximal degree in co-relation 97763. Up to 5538 conditions per place. [2022-12-13 13:52:35,464 INFO L137 encePairwiseOnDemand]: 80/114 looper letters, 738 selfloop transitions, 83 changer transitions 11/832 dead transitions. [2022-12-13 13:52:35,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 832 transitions, 31480 flow [2022-12-13 13:52:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:52:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 13:52:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 181 transitions. [2022-12-13 13:52:35,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12213225371120108 [2022-12-13 13:52:35,465 INFO L175 Difference]: Start difference. First operand has 449 places, 770 transitions, 28047 flow. Second operand 13 states and 181 transitions. [2022-12-13 13:52:35,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 832 transitions, 31480 flow [2022-12-13 13:52:38,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 832 transitions, 31106 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-12-13 13:52:38,662 INFO L231 Difference]: Finished difference. Result has 457 places, 776 transitions, 28207 flow [2022-12-13 13:52:38,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=27678, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=28207, PETRI_PLACES=457, PETRI_TRANSITIONS=776} [2022-12-13 13:52:38,663 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 436 predicate places. [2022-12-13 13:52:38,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:52:38,663 INFO L89 Accepts]: Start accepts. Operand has 457 places, 776 transitions, 28207 flow [2022-12-13 13:52:38,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:52:38,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:52:38,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 457 places, 776 transitions, 28207 flow [2022-12-13 13:52:38,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 457 places, 776 transitions, 28207 flow [2022-12-13 13:52:39,237 INFO L130 PetriNetUnfolder]: 801/2296 cut-off events. [2022-12-13 13:52:39,237 INFO L131 PetriNetUnfolder]: For 313633/314113 co-relation queries the response was YES. [2022-12-13 13:52:39,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41321 conditions, 2296 events. 801/2296 cut-off events. For 313633/314113 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 21200 event pairs, 96 based on Foata normal form. 32/2282 useless extension candidates. Maximal degree in co-relation 40940. Up to 877 conditions per place. [2022-12-13 13:52:39,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 457 places, 776 transitions, 28207 flow [2022-12-13 13:52:39,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 2042 [2022-12-13 13:52:41,309 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:52:41,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2646 [2022-12-13 13:52:41,310 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 776 transitions, 28367 flow [2022-12-13 13:52:41,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:41,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:52:41,310 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:52:41,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 13:52:41,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-13 13:52:41,515 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:52:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:52:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 209772109, now seen corresponding path program 2 times [2022-12-13 13:52:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:52:41,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919836299] [2022-12-13 13:52:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:52:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:41,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:52:41,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919836299] [2022-12-13 13:52:41,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919836299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:52:41,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084073571] [2022-12-13 13:52:41,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:52:41,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:52:41,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:52:41,590 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:52:41,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 13:52:41,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:52:41,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:52:41,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:52:41,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:52:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:41,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:52:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:41,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084073571] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:52:41,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:52:41,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:52:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132483988] [2022-12-13 13:52:41,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:52:41,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:52:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:52:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:52:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:52:41,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-13 13:52:41,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 776 transitions, 28367 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:41,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:52:41,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-13 13:52:41,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:52:45,460 INFO L130 PetriNetUnfolder]: 3272/6116 cut-off events. [2022-12-13 13:52:45,460 INFO L131 PetriNetUnfolder]: For 776890/776890 co-relation queries the response was YES. [2022-12-13 13:52:45,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103589 conditions, 6116 events. 3272/6116 cut-off events. For 776890/776890 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 47569 event pairs, 525 based on Foata normal form. 16/6122 useless extension candidates. Maximal degree in co-relation 102695. Up to 2684 conditions per place. [2022-12-13 13:52:45,639 INFO L137 encePairwiseOnDemand]: 27/116 looper letters, 641 selfloop transitions, 323 changer transitions 15/979 dead transitions. [2022-12-13 13:52:45,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 979 transitions, 35102 flow [2022-12-13 13:52:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:52:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 13:52:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 215 transitions. [2022-12-13 13:52:45,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09754990925589836 [2022-12-13 13:52:45,640 INFO L175 Difference]: Start difference. First operand has 457 places, 776 transitions, 28367 flow. Second operand 19 states and 215 transitions. [2022-12-13 13:52:45,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 979 transitions, 35102 flow [2022-12-13 13:52:49,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 979 transitions, 34711 flow, removed 175 selfloop flow, removed 2 redundant places. [2022-12-13 13:52:49,187 INFO L231 Difference]: Finished difference. Result has 483 places, 821 transitions, 30769 flow [2022-12-13 13:52:49,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=27978, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=30769, PETRI_PLACES=483, PETRI_TRANSITIONS=821} [2022-12-13 13:52:49,188 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 462 predicate places. [2022-12-13 13:52:49,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:52:49,188 INFO L89 Accepts]: Start accepts. Operand has 483 places, 821 transitions, 30769 flow [2022-12-13 13:52:49,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:52:49,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:52:49,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 483 places, 821 transitions, 30769 flow [2022-12-13 13:52:49,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 483 places, 821 transitions, 30769 flow [2022-12-13 13:52:49,859 INFO L130 PetriNetUnfolder]: 821/2372 cut-off events. [2022-12-13 13:52:49,860 INFO L131 PetriNetUnfolder]: For 361797/362260 co-relation queries the response was YES. [2022-12-13 13:52:49,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44209 conditions, 2372 events. 821/2372 cut-off events. For 361797/362260 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 22351 event pairs, 87 based on Foata normal form. 31/2357 useless extension candidates. Maximal degree in co-relation 43755. Up to 902 conditions per place. [2022-12-13 13:52:49,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 483 places, 821 transitions, 30769 flow [2022-12-13 13:52:49,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 2164 [2022-12-13 13:52:49,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 13:52:50,688 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:52:50,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1501 [2022-12-13 13:52:50,689 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 819 transitions, 30856 flow [2022-12-13 13:52:50,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:50,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:52:50,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:52:50,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-13 13:52:50,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-13 13:52:50,894 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:52:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:52:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1887269607, now seen corresponding path program 1 times [2022-12-13 13:52:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:52:50,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878319900] [2022-12-13 13:52:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:52:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:52:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:52:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:52:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:52:50,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878319900] [2022-12-13 13:52:50,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878319900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:52:50,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:52:50,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:52:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289219548] [2022-12-13 13:52:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:52:50,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:52:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:52:50,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:52:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:52:50,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 122 [2022-12-13 13:52:50,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 819 transitions, 30856 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:52:50,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:52:50,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 122 [2022-12-13 13:52:50,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:52:53,819 INFO L130 PetriNetUnfolder]: 3227/6048 cut-off events. [2022-12-13 13:52:53,819 INFO L131 PetriNetUnfolder]: For 842859/842859 co-relation queries the response was YES. [2022-12-13 13:52:53,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106260 conditions, 6048 events. 3227/6048 cut-off events. For 842859/842859 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 46731 event pairs, 1166 based on Foata normal form. 12/6050 useless extension candidates. Maximal degree in co-relation 105354. Up to 5007 conditions per place. [2022-12-13 13:52:53,916 INFO L137 encePairwiseOnDemand]: 64/122 looper letters, 683 selfloop transitions, 175 changer transitions 3/861 dead transitions. [2022-12-13 13:52:53,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 861 transitions, 33687 flow [2022-12-13 13:52:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:52:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:52:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2022-12-13 13:52:53,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21174863387978143 [2022-12-13 13:52:53,917 INFO L175 Difference]: Start difference. First operand has 481 places, 819 transitions, 30856 flow. Second operand 6 states and 155 transitions. [2022-12-13 13:52:53,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 861 transitions, 33687 flow Received shutdown request... [2022-12-13 13:52:55,727 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 13:52:55,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 13:52:55,727 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-13 13:52:55,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 13:52:55,729 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 13:52:55,729 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:52:55,731 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:52:55,731 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:52:55,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:52:55 BasicIcfg [2022-12-13 13:52:55,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:52:55,732 INFO L158 Benchmark]: Toolchain (without parser) took 845573.22ms. Allocated memory was 166.7MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 143.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 13:52:55,732 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:52:55,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.95ms. Allocated memory is still 166.7MB. Free memory was 143.9MB in the beginning and 132.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 13:52:55,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.42ms. Allocated memory is still 166.7MB. Free memory was 132.3MB in the beginning and 130.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 13:52:55,733 INFO L158 Benchmark]: Boogie Preprocessor took 18.78ms. Allocated memory is still 166.7MB. Free memory was 130.8MB in the beginning and 129.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:52:55,733 INFO L158 Benchmark]: RCFGBuilder took 396.97ms. Allocated memory is still 166.7MB. Free memory was 129.2MB in the beginning and 113.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 13:52:55,733 INFO L158 Benchmark]: TraceAbstraction took 844919.14ms. Allocated memory was 166.7MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 111.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-13 13:52:55,733 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.09ms. Allocated memory is still 166.7MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.95ms. Allocated memory is still 166.7MB. Free memory was 143.9MB in the beginning and 132.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.42ms. Allocated memory is still 166.7MB. Free memory was 132.3MB in the beginning and 130.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.78ms. Allocated memory is still 166.7MB. Free memory was 130.8MB in the beginning and 129.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 396.97ms. Allocated memory is still 166.7MB. Free memory was 129.2MB in the beginning and 113.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 844919.14ms. Allocated memory was 166.7MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 111.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 137 PlacesBefore, 21 PlacesAfterwards, 144 TransitionsBefore, 17 TransitionsAfterwards, 1942 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 47 ConcurrentYvCompositions, 11 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 1248, 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: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, 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: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, 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: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, 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: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, 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: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, 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: 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] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 0, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2121, Positive conditional cache size: 0, Positive unconditional cache size: 2121, 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.7s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, 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: 7, independent: 7, independent conditional: 1, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 21, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 64 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): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 3, independent unconditional: 15, 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: 18, independent: 18, independent conditional: 3, independent unconditional: 15, 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: 18, independent: 18, independent conditional: 3, independent unconditional: 15, 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: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 50 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): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 26 PlacesBefore, 26 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 66 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): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 58 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: 2, dependent unconditional: 0, 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: 4, dependent unconditional: 0, 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: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.9s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 2, dependent unconditional: 0, 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: 2, dependent unconditional: 0, 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: 2, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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: 4.1s, 36 PlacesBefore, 34 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 34, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 36 PlacesBefore, 36 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 138 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): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.4s, 41 PlacesBefore, 41 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 43 PlacesBefore, 43 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 210 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): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 50 PlacesBefore, 50 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 56 PlacesBefore, 57 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 56, Positive cache size: 54, Positive conditional cache size: 32, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 64 PlacesBefore, 64 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 376 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): 56, Positive cache size: 54, Positive conditional cache size: 32, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 70 PlacesBefore, 70 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 400 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): 56, Positive cache size: 54, Positive conditional cache size: 32, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 76 PlacesBefore, 76 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 58, Positive cache size: 56, Positive conditional cache size: 34, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.3s, 91 PlacesBefore, 90 PlacesAfterwards, 125 TransitionsBefore, 124 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 2, independent unconditional: 3, 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: 2, independent unconditional: 3, 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: 2, independent unconditional: 3, 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: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 70, Positive conditional cache size: 41, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 94 PlacesBefore, 96 PlacesAfterwards, 126 TransitionsBefore, 128 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 53, independent conditional: 53, 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: 53, independent: 53, independent conditional: 53, 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: 53, independent: 53, independent conditional: 53, 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: 53, independent: 53, independent conditional: 53, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 53, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 100 PlacesBefore, 100 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 85, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.5s, 100 PlacesBefore, 99 PlacesAfterwards, 143 TransitionsBefore, 142 TransitionsAfterwards, 382 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 88, Positive conditional cache size: 58, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.4s, 104 PlacesBefore, 104 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 94, Positive cache size: 92, Positive conditional cache size: 62, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.1s, 117 PlacesBefore, 117 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 94, Positive cache size: 92, Positive conditional cache size: 62, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 130 PlacesBefore, 130 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 95, Positive conditional cache size: 65, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 132 PlacesBefore, 132 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 568 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): 97, Positive cache size: 95, Positive conditional cache size: 65, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.6s, 152 PlacesBefore, 152 PlacesAfterwards, 208 TransitionsBefore, 208 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 98, Positive conditional cache size: 68, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 164 PlacesBefore, 164 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 718 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): 100, Positive cache size: 98, Positive conditional cache size: 68, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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: 3.0s, 172 PlacesBefore, 172 PlacesAfterwards, 239 TransitionsBefore, 239 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 102, Positive cache size: 100, Positive conditional cache size: 70, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.5s, 177 PlacesBefore, 178 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 185 PlacesBefore, 185 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 768 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 187 PlacesBefore, 187 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 760 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 190 PlacesBefore, 190 PlacesAfterwards, 255 TransitionsBefore, 255 TransitionsAfterwards, 790 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 193 PlacesBefore, 193 PlacesAfterwards, 260 TransitionsBefore, 260 TransitionsAfterwards, 808 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): 109, Positive cache size: 107, Positive conditional cache size: 77, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 201 PlacesBefore, 200 PlacesAfterwards, 279 TransitionsBefore, 278 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 108, Positive conditional cache size: 78, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.5s, 209 PlacesBefore, 209 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 109, Positive conditional cache size: 79, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.4s, 211 PlacesBefore, 211 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 892 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 110, Positive conditional cache size: 80, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.9s, 225 PlacesBefore, 224 PlacesAfterwards, 301 TransitionsBefore, 300 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 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: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 131, Positive conditional cache size: 100, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 225 PlacesBefore, 225 PlacesAfterwards, 301 TransitionsBefore, 301 TransitionsAfterwards, 918 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): 133, Positive cache size: 131, Positive conditional cache size: 100, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 237 PlacesBefore, 237 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 135, Positive cache size: 133, Positive conditional cache size: 102, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 239 PlacesBefore, 239 PlacesAfterwards, 327 TransitionsBefore, 327 TransitionsAfterwards, 1014 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): 135, Positive cache size: 133, Positive conditional cache size: 102, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 255 PlacesBefore, 255 PlacesAfterwards, 342 TransitionsBefore, 342 TransitionsAfterwards, 1060 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 136, Positive conditional cache size: 105, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 252 PlacesBefore, 252 PlacesAfterwards, 342 TransitionsBefore, 342 TransitionsAfterwards, 1062 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 137, Positive conditional cache size: 106, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 261 PlacesBefore, 260 PlacesAfterwards, 369 TransitionsBefore, 368 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 6, independent conditional: 6, 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): 142, Positive cache size: 140, Positive conditional cache size: 108, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 265 PlacesBefore, 265 PlacesAfterwards, 373 TransitionsBefore, 373 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 278 PlacesBefore, 278 PlacesAfterwards, 385 TransitionsBefore, 385 TransitionsAfterwards, 1202 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 287 PlacesBefore, 287 PlacesAfterwards, 402 TransitionsBefore, 402 TransitionsAfterwards, 1250 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 288 PlacesBefore, 288 PlacesAfterwards, 406 TransitionsBefore, 406 TransitionsAfterwards, 1262 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 291 PlacesBefore, 291 PlacesAfterwards, 412 TransitionsBefore, 412 TransitionsAfterwards, 1300 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): 143, Positive cache size: 141, Positive conditional cache size: 109, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.2s, 302 PlacesBefore, 302 PlacesAfterwards, 419 TransitionsBefore, 419 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 170, Positive conditional cache size: 137, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.0s, 304 PlacesBefore, 304 PlacesAfterwards, 419 TransitionsBefore, 419 TransitionsAfterwards, 1316 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 171, Positive conditional cache size: 138, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.1s, 316 PlacesBefore, 315 PlacesAfterwards, 427 TransitionsBefore, 426 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 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: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 182, Positive conditional cache size: 147, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.2s, 311 PlacesBefore, 311 PlacesAfterwards, 432 TransitionsBefore, 432 TransitionsAfterwards, 1356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 1, independent conditional: 1, 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): 186, Positive cache size: 184, Positive conditional cache size: 149, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 320 PlacesBefore, 320 PlacesAfterwards, 452 TransitionsBefore, 452 TransitionsAfterwards, 1450 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): 186, Positive cache size: 184, Positive conditional cache size: 149, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 348 PlacesBefore, 346 PlacesAfterwards, 558 TransitionsBefore, 556 TransitionsAfterwards, 1606 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 43, independent conditional: 43, 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: 43, independent: 43, independent conditional: 43, 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: 43, independent: 43, independent conditional: 43, 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: 43, independent: 43, independent conditional: 43, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 43, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 203, Positive conditional cache size: 168, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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: 7.2s, 390 PlacesBefore, 389 PlacesAfterwards, 614 TransitionsBefore, 612 TransitionsAfterwards, 1696 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 21, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 241, Positive conditional cache size: 205, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.9s, 394 PlacesBefore, 394 PlacesAfterwards, 633 TransitionsBefore, 633 TransitionsAfterwards, 1752 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 242, Positive conditional cache size: 206, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 389 PlacesBefore, 389 PlacesAfterwards, 630 TransitionsBefore, 630 TransitionsAfterwards, 1746 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): 244, Positive cache size: 242, Positive conditional cache size: 206, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.4s, 395 PlacesBefore, 395 PlacesAfterwards, 651 TransitionsBefore, 651 TransitionsAfterwards, 1742 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 245, Positive conditional cache size: 209, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 397 PlacesBefore, 397 PlacesAfterwards, 655 TransitionsBefore, 655 TransitionsAfterwards, 1748 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): 247, Positive cache size: 245, Positive conditional cache size: 209, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 411 PlacesBefore, 411 PlacesAfterwards, 677 TransitionsBefore, 677 TransitionsAfterwards, 1800 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 246, Positive conditional cache size: 210, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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: 4.2s, 415 PlacesBefore, 415 PlacesAfterwards, 700 TransitionsBefore, 700 TransitionsAfterwards, 1820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 247, Positive conditional cache size: 211, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 415 PlacesBefore, 415 PlacesAfterwards, 704 TransitionsBefore, 704 TransitionsAfterwards, 1842 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): 249, Positive cache size: 247, Positive conditional cache size: 211, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 417 PlacesBefore, 417 PlacesAfterwards, 704 TransitionsBefore, 704 TransitionsAfterwards, 1840 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): 249, Positive cache size: 247, Positive conditional cache size: 211, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 419 PlacesBefore, 419 PlacesAfterwards, 705 TransitionsBefore, 705 TransitionsAfterwards, 1846 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): 249, Positive cache size: 247, Positive conditional cache size: 211, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 430 PlacesBefore, 430 PlacesAfterwards, 747 TransitionsBefore, 747 TransitionsAfterwards, 1958 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): 249, Positive cache size: 247, Positive conditional cache size: 211, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 441 PlacesBefore, 441 PlacesAfterwards, 756 TransitionsBefore, 756 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 252, Positive cache size: 250, Positive conditional cache size: 213, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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, 449 PlacesBefore, 449 PlacesAfterwards, 770 TransitionsBefore, 770 TransitionsAfterwards, 2020 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): 252, Positive cache size: 250, Positive conditional cache size: 213, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.0s, 457 PlacesBefore, 457 PlacesAfterwards, 776 TransitionsBefore, 776 TransitionsAfterwards, 2042 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 258, Positive cache size: 256, Positive conditional cache size: 218, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, 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.8s, 483 PlacesBefore, 481 PlacesAfterwards, 821 TransitionsBefore, 819 TransitionsAfterwards, 2164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 21, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 280, Positive conditional cache size: 239, Positive unconditional cache size: 41, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 189 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 844.8s, OverallIterations: 71, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 222.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 2566 SdHoareTripleChecker+Valid, 81.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2566 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 77.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 162 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30806 IncrementalHoareTripleChecker+Invalid, 33195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2201 mSolverCounterUnsat, 5 mSDtfsCounter, 30806 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1486 GetRequests, 848 SyntacticMatches, 26 SemanticMatches, 612 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30856occurred in iteration=70, InterpolantAutomatonStates: 559, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 526.7s InterpolantComputationTime, 1454 NumberOfCodeBlocks, 1453 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 1791 ConstructedInterpolants, 12 QuantifiedInterpolants, 33643 SizeOfPredicates, 259 NumberOfNonLiveVariables, 7627 ConjunctsInSsa, 659 ConjunctsInUnsatCore, 145 InterpolantComputations, 36 PerfectInterpolantSequences, 44/170 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown