/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:14:29,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:14:29,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:14:29,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:14:29,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:14:29,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:14:29,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:14:29,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:14:29,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:14:29,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:14:29,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:14:29,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:14:29,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:14:29,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:14:29,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:14:29,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:14:29,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:14:29,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:14:29,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:14:29,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:14:29,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:14:29,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:14:29,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:14:29,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:14:29,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:14:29,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:14:29,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:14:29,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:14:29,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:14:29,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:14:29,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:14:29,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:14:29,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:14:29,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:14:29,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:14:29,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:14:29,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:14:29,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:14:29,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:14:29,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:14:29,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:14:29,889 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:14:29,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:14:29,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:14:29,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:14:29,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:14:29,915 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:14:29,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:14:29,915 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:14:29,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:14:29,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:14:29,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:14:29,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:14:29,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:14:29,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:14:29,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:14:29,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:14:29,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:14:29,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:14:29,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:14:29,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:14:29,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:14:29,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:14:29,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:14:30,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:14:30,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:14:30,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:14:30,373 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:14:30,373 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:14:30,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-06 05:14:31,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:14:31,455 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:14:31,456 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-06 05:14:31,461 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1511bfdd7/a77510f8e84746ceae4809e1518cdfde/FLAG389c64c87 [2022-12-06 05:14:31,472 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1511bfdd7/a77510f8e84746ceae4809e1518cdfde [2022-12-06 05:14:31,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:14:31,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:14:31,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:14:31,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:14:31,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:14:31,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f19bd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31, skipping insertion in model container [2022-12-06 05:14:31,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:14:31,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:14:31,629 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-06 05:14:31,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:14:31,649 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:14:31,682 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3292,3305] [2022-12-06 05:14:31,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:14:31,696 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:14:31,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31 WrapperNode [2022-12-06 05:14:31,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:14:31,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:14:31,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:14:31,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:14:31,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,744 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-12-06 05:14:31,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:14:31,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:14:31,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:14:31,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:14:31,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,777 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:14:31,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:14:31,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:14:31,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:14:31,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:14:31,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:14:31,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:14:31,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:14:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:14:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:14:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:14:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:14:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:14:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:14:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:14:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:14:31,863 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:14:31,993 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:14:31,995 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:14:32,303 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:14:32,310 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:14:32,310 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:14:32,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:32 BoogieIcfgContainer [2022-12-06 05:14:32,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:14:32,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:14:32,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:14:32,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:14:32,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:14:31" (1/3) ... [2022-12-06 05:14:32,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d22191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:32, skipping insertion in model container [2022-12-06 05:14:32,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (2/3) ... [2022-12-06 05:14:32,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d22191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:32, skipping insertion in model container [2022-12-06 05:14:32,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:32" (3/3) ... [2022-12-06 05:14:32,316 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-12-06 05:14:32,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:14:32,328 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:14:32,329 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:14:32,459 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:14:32,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 282 transitions, 588 flow [2022-12-06 05:14:32,608 INFO L130 PetriNetUnfolder]: 28/279 cut-off events. [2022-12-06 05:14:32,609 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:14:32,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 279 events. 28/279 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-06 05:14:32,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 282 transitions, 588 flow [2022-12-06 05:14:32,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 269 transitions, 556 flow [2022-12-06 05:14:32,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:32,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 269 transitions, 556 flow [2022-12-06 05:14:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 269 transitions, 556 flow [2022-12-06 05:14:32,670 INFO L130 PetriNetUnfolder]: 28/269 cut-off events. [2022-12-06 05:14:32,671 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:14:32,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 269 events. 28/269 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 367 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-06 05:14:32,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 269 transitions, 556 flow [2022-12-06 05:14:32,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 7560 [2022-12-06 05:14:40,467 INFO L203 LiptonReduction]: Total number of compositions: 230 [2022-12-06 05:14:40,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:14:40,504 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;@5398cd64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:14:40,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:14:40,525 INFO L130 PetriNetUnfolder]: 11/38 cut-off events. [2022-12-06 05:14:40,525 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:14:40,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:40,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:40,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1480647140, now seen corresponding path program 1 times [2022-12-06 05:14:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:40,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884051156] [2022-12-06 05:14:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884051156] [2022-12-06 05:14:41,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884051156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:41,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:41,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716063253] [2022-12-06 05:14:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:41,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:41,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:41,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:14:41,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:41,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:41,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:14:41,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:41,459 INFO L130 PetriNetUnfolder]: 1171/1614 cut-off events. [2022-12-06 05:14:41,459 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-06 05:14:41,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 1614 events. 1171/1614 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6034 event pairs, 283 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 2876. Up to 593 conditions per place. [2022-12-06 05:14:41,470 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 100 selfloop transitions, 18 changer transitions 2/121 dead transitions. [2022-12-06 05:14:41,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 121 transitions, 539 flow [2022-12-06 05:14:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:14:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:14:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-06 05:14:41,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2022-12-06 05:14:41,484 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 96 flow. Second operand 7 states and 128 transitions. [2022-12-06 05:14:41,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 121 transitions, 539 flow [2022-12-06 05:14:41,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 121 transitions, 501 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:14:41,491 INFO L231 Difference]: Finished difference. Result has 42 places, 55 transitions, 196 flow [2022-12-06 05:14:41,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=42, PETRI_TRANSITIONS=55} [2022-12-06 05:14:41,495 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 05:14:41,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:41,496 INFO L89 Accepts]: Start accepts. Operand has 42 places, 55 transitions, 196 flow [2022-12-06 05:14:41,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:41,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:41,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 55 transitions, 196 flow [2022-12-06 05:14:41,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 55 transitions, 196 flow [2022-12-06 05:14:41,508 INFO L130 PetriNetUnfolder]: 30/97 cut-off events. [2022-12-06 05:14:41,509 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-12-06 05:14:41,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 97 events. 30/97 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 285 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 118. Up to 19 conditions per place. [2022-12-06 05:14:41,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 55 transitions, 196 flow [2022-12-06 05:14:41,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 05:14:41,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:14:41,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1052] L49-6-->thread1EXIT: Formula: (and (let ((.cse1 (= |v_thread1Thread1of1ForFork0_#res.offset_17| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res.base_17| 0)) (.cse0 (= 0 (mod v_thread1Thread1of1ForFork0_~stop~0_41 256)))) (or (and (= (+ v_~n2~0_80 v_~res1~0_58) v_~n1~0_94) .cse0 .cse1 .cse2) (and .cse1 (= v_~res1~0_59 v_~res1~0_58) .cse2 (not .cse0)))) (or (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n2~0_80)) (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n1~0_94)))) InVars {~res1~0=v_~res1~0_59, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} OutVars{~res1~0=v_~res1~0_58, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_17|, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_17|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-06 05:14:42,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:14:42,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:14:42,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:14:42,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:14:42,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1054] L69-6-->thread2EXIT: Formula: (and (or (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n3~0_88)) (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n2~0_84))) (let ((.cse2 (= (mod v_thread2Thread1of1ForFork1_~stop~1_33 256) 0)) (.cse0 (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) (or (and .cse0 (= (+ v_~n3~0_88 v_~res2~0_56) v_~n2~0_84) .cse1 .cse2) (and (not .cse2) (= v_~res2~0_57 v_~res2~0_56) .cse0 .cse1)))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, ~res2~0=v_~res2~0_57} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~res2~0=v_~res2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:14:43,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:14:43,190 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:14:43,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1696 [2022-12-06 05:14:43,192 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 55 transitions, 223 flow [2022-12-06 05:14:43,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:43,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:43,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:43,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:14:43,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -404154940, now seen corresponding path program 2 times [2022-12-06 05:14:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959164903] [2022-12-06 05:14:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:43,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959164903] [2022-12-06 05:14:43,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959164903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:43,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:43,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033119272] [2022-12-06 05:14:43,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:43,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:43,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:14:43,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 55 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:43,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:43,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:14:43,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:43,710 INFO L130 PetriNetUnfolder]: 1281/1861 cut-off events. [2022-12-06 05:14:43,710 INFO L131 PetriNetUnfolder]: For 813/813 co-relation queries the response was YES. [2022-12-06 05:14:43,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 1861 events. 1281/1861 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7923 event pairs, 273 based on Foata normal form. 1/1698 useless extension candidates. Maximal degree in co-relation 4535. Up to 813 conditions per place. [2022-12-06 05:14:43,718 INFO L137 encePairwiseOnDemand]: 32/47 looper letters, 90 selfloop transitions, 18 changer transitions 2/111 dead transitions. [2022-12-06 05:14:43,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 111 transitions, 612 flow [2022-12-06 05:14:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 05:14:43,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4297872340425532 [2022-12-06 05:14:43,720 INFO L175 Difference]: Start difference. First operand has 42 places, 55 transitions, 223 flow. Second operand 5 states and 101 transitions. [2022-12-06 05:14:43,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 111 transitions, 612 flow [2022-12-06 05:14:43,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 111 transitions, 586 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:43,727 INFO L231 Difference]: Finished difference. Result has 48 places, 61 transitions, 301 flow [2022-12-06 05:14:43,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=48, PETRI_TRANSITIONS=61} [2022-12-06 05:14:43,728 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 05:14:43,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:43,728 INFO L89 Accepts]: Start accepts. Operand has 48 places, 61 transitions, 301 flow [2022-12-06 05:14:43,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:43,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:43,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 61 transitions, 301 flow [2022-12-06 05:14:43,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 61 transitions, 301 flow [2022-12-06 05:14:43,742 INFO L130 PetriNetUnfolder]: 44/170 cut-off events. [2022-12-06 05:14:43,742 INFO L131 PetriNetUnfolder]: For 85/95 co-relation queries the response was YES. [2022-12-06 05:14:43,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 170 events. 44/170 cut-off events. For 85/95 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 820 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 309. Up to 35 conditions per place. [2022-12-06 05:14:43,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 61 transitions, 301 flow [2022-12-06 05:14:43,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-06 05:14:43,745 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:43,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:14:43,746 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 61 transitions, 301 flow [2022-12-06 05:14:43,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:43,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:43,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:43,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:14:43,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:43,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1255969656, now seen corresponding path program 3 times [2022-12-06 05:14:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:43,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787731470] [2022-12-06 05:14:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:43,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:43,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787731470] [2022-12-06 05:14:43,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787731470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:43,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:43,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002041454] [2022-12-06 05:14:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:43,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:14:43,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 61 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:43,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:43,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:14:43,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:44,297 INFO L130 PetriNetUnfolder]: 1494/2210 cut-off events. [2022-12-06 05:14:44,298 INFO L131 PetriNetUnfolder]: For 2241/2241 co-relation queries the response was YES. [2022-12-06 05:14:44,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 2210 events. 1494/2210 cut-off events. For 2241/2241 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10065 event pairs, 355 based on Foata normal form. 1/2017 useless extension candidates. Maximal degree in co-relation 5952. Up to 913 conditions per place. [2022-12-06 05:14:44,307 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 97 selfloop transitions, 22 changer transitions 2/122 dead transitions. [2022-12-06 05:14:44,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 122 transitions, 757 flow [2022-12-06 05:14:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:14:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:14:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-12-06 05:14:44,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 05:14:44,309 INFO L175 Difference]: Start difference. First operand has 47 places, 61 transitions, 301 flow. Second operand 6 states and 117 transitions. [2022-12-06 05:14:44,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 122 transitions, 757 flow [2022-12-06 05:14:44,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 122 transitions, 716 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:44,317 INFO L231 Difference]: Finished difference. Result has 53 places, 64 transitions, 367 flow [2022-12-06 05:14:44,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=53, PETRI_TRANSITIONS=64} [2022-12-06 05:14:44,318 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 05:14:44,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:44,318 INFO L89 Accepts]: Start accepts. Operand has 53 places, 64 transitions, 367 flow [2022-12-06 05:14:44,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:44,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:44,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 64 transitions, 367 flow [2022-12-06 05:14:44,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 64 transitions, 367 flow [2022-12-06 05:14:44,332 INFO L130 PetriNetUnfolder]: 45/210 cut-off events. [2022-12-06 05:14:44,332 INFO L131 PetriNetUnfolder]: For 236/290 co-relation queries the response was YES. [2022-12-06 05:14:44,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 210 events. 45/210 cut-off events. For 236/290 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1193 event pairs, 0 based on Foata normal form. 1/184 useless extension candidates. Maximal degree in co-relation 390. Up to 35 conditions per place. [2022-12-06 05:14:44,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 64 transitions, 367 flow [2022-12-06 05:14:44,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 05:14:44,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:14:44,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:14:44,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 05:14:44,523 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 371 flow [2022-12-06 05:14:44,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:44,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:44,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:44,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:14:44,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1269268782, now seen corresponding path program 4 times [2022-12-06 05:14:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783689494] [2022-12-06 05:14:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:44,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:44,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783689494] [2022-12-06 05:14:44,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783689494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:44,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:44,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733679507] [2022-12-06 05:14:44,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:44,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:44,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 05:14:44,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 64 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:44,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:44,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 05:14:44,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:44,993 INFO L130 PetriNetUnfolder]: 1541/2284 cut-off events. [2022-12-06 05:14:44,993 INFO L131 PetriNetUnfolder]: For 2894/2894 co-relation queries the response was YES. [2022-12-06 05:14:44,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7285 conditions, 2284 events. 1541/2284 cut-off events. For 2894/2894 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10362 event pairs, 669 based on Foata normal form. 1/2094 useless extension candidates. Maximal degree in co-relation 6697. Up to 1481 conditions per place. [2022-12-06 05:14:45,002 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 94 selfloop transitions, 15 changer transitions 2/112 dead transitions. [2022-12-06 05:14:45,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 112 transitions, 756 flow [2022-12-06 05:14:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 05:14:45,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4391304347826087 [2022-12-06 05:14:45,004 INFO L175 Difference]: Start difference. First operand has 53 places, 64 transitions, 371 flow. Second operand 5 states and 101 transitions. [2022-12-06 05:14:45,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 112 transitions, 756 flow [2022-12-06 05:14:45,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 734 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:45,014 INFO L231 Difference]: Finished difference. Result has 59 places, 70 transitions, 458 flow [2022-12-06 05:14:45,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=59, PETRI_TRANSITIONS=70} [2022-12-06 05:14:45,014 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 05:14:45,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:45,015 INFO L89 Accepts]: Start accepts. Operand has 59 places, 70 transitions, 458 flow [2022-12-06 05:14:45,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:45,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:45,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 70 transitions, 458 flow [2022-12-06 05:14:45,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 70 transitions, 458 flow [2022-12-06 05:14:45,030 INFO L130 PetriNetUnfolder]: 55/232 cut-off events. [2022-12-06 05:14:45,031 INFO L131 PetriNetUnfolder]: For 446/495 co-relation queries the response was YES. [2022-12-06 05:14:45,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 232 events. 55/232 cut-off events. For 446/495 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1327 event pairs, 0 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 516. Up to 41 conditions per place. [2022-12-06 05:14:45,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 70 transitions, 458 flow [2022-12-06 05:14:45,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-06 05:14:45,033 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:45,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 05:14:45,034 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 70 transitions, 458 flow [2022-12-06 05:14:45,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:45,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:45,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:45,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:14:45,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash -726260692, now seen corresponding path program 5 times [2022-12-06 05:14:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:45,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659779342] [2022-12-06 05:14:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:45,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659779342] [2022-12-06 05:14:45,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659779342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:45,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:45,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880449710] [2022-12-06 05:14:45,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:45,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:45,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:45,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:45,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:14:45,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 70 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:45,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:45,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:14:45,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:45,573 INFO L130 PetriNetUnfolder]: 1634/2443 cut-off events. [2022-12-06 05:14:45,573 INFO L131 PetriNetUnfolder]: For 4663/4663 co-relation queries the response was YES. [2022-12-06 05:14:45,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8455 conditions, 2443 events. 1634/2443 cut-off events. For 4663/4663 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11628 event pairs, 277 based on Foata normal form. 1/2250 useless extension candidates. Maximal degree in co-relation 7655. Up to 1369 conditions per place. [2022-12-06 05:14:45,587 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 117 selfloop transitions, 29 changer transitions 1/148 dead transitions. [2022-12-06 05:14:45,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 148 transitions, 1061 flow [2022-12-06 05:14:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:14:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:14:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-06 05:14:45,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 05:14:45,588 INFO L175 Difference]: Start difference. First operand has 58 places, 70 transitions, 458 flow. Second operand 6 states and 126 transitions. [2022-12-06 05:14:45,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 148 transitions, 1061 flow [2022-12-06 05:14:45,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 148 transitions, 1021 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:45,601 INFO L231 Difference]: Finished difference. Result has 66 places, 86 transitions, 677 flow [2022-12-06 05:14:45,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=66, PETRI_TRANSITIONS=86} [2022-12-06 05:14:45,605 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2022-12-06 05:14:45,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:45,605 INFO L89 Accepts]: Start accepts. Operand has 66 places, 86 transitions, 677 flow [2022-12-06 05:14:45,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:45,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:45,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 86 transitions, 677 flow [2022-12-06 05:14:45,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 86 transitions, 677 flow [2022-12-06 05:14:45,628 INFO L130 PetriNetUnfolder]: 79/319 cut-off events. [2022-12-06 05:14:45,629 INFO L131 PetriNetUnfolder]: For 749/793 co-relation queries the response was YES. [2022-12-06 05:14:45,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 319 events. 79/319 cut-off events. For 749/793 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2093 event pairs, 0 based on Foata normal form. 6/286 useless extension candidates. Maximal degree in co-relation 707. Up to 55 conditions per place. [2022-12-06 05:14:45,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 86 transitions, 677 flow [2022-12-06 05:14:45,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 960 [2022-12-06 05:14:45,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:45,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:14:45,634 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 86 transitions, 677 flow [2022-12-06 05:14:45,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:45,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:45,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:45,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:14:45,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash -810105417, now seen corresponding path program 1 times [2022-12-06 05:14:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:45,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132919520] [2022-12-06 05:14:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:45,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:45,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132919520] [2022-12-06 05:14:45,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132919520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:45,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:45,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:45,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503819338] [2022-12-06 05:14:45,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:45,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:14:45,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 86 transitions, 677 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:45,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:45,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:14:45,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:46,154 INFO L130 PetriNetUnfolder]: 1672/2541 cut-off events. [2022-12-06 05:14:46,155 INFO L131 PetriNetUnfolder]: For 6135/6135 co-relation queries the response was YES. [2022-12-06 05:14:46,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9523 conditions, 2541 events. 1672/2541 cut-off events. For 6135/6135 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12376 event pairs, 205 based on Foata normal form. 1/2426 useless extension candidates. Maximal degree in co-relation 8244. Up to 980 conditions per place. [2022-12-06 05:14:46,174 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 137 selfloop transitions, 37 changer transitions 7/182 dead transitions. [2022-12-06 05:14:46,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 182 transitions, 1538 flow [2022-12-06 05:14:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:14:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:14:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-06 05:14:46,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2022-12-06 05:14:46,180 INFO L175 Difference]: Start difference. First operand has 66 places, 86 transitions, 677 flow. Second operand 7 states and 142 transitions. [2022-12-06 05:14:46,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 182 transitions, 1538 flow [2022-12-06 05:14:46,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 182 transitions, 1526 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 05:14:46,196 INFO L231 Difference]: Finished difference. Result has 75 places, 101 transitions, 949 flow [2022-12-06 05:14:46,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=949, PETRI_PLACES=75, PETRI_TRANSITIONS=101} [2022-12-06 05:14:46,198 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-06 05:14:46,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:46,198 INFO L89 Accepts]: Start accepts. Operand has 75 places, 101 transitions, 949 flow [2022-12-06 05:14:46,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:46,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:46,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 101 transitions, 949 flow [2022-12-06 05:14:46,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 101 transitions, 949 flow [2022-12-06 05:14:46,222 INFO L130 PetriNetUnfolder]: 89/340 cut-off events. [2022-12-06 05:14:46,222 INFO L131 PetriNetUnfolder]: For 1199/1251 co-relation queries the response was YES. [2022-12-06 05:14:46,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 340 events. 89/340 cut-off events. For 1199/1251 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2192 event pairs, 1 based on Foata normal form. 3/309 useless extension candidates. Maximal degree in co-relation 817. Up to 57 conditions per place. [2022-12-06 05:14:46,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 101 transitions, 949 flow [2022-12-06 05:14:46,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-06 05:14:46,226 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:46,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:14:46,227 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 101 transitions, 949 flow [2022-12-06 05:14:46,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:46,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:46,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:46,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:14:46,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1050640634, now seen corresponding path program 6 times [2022-12-06 05:14:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:46,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284038093] [2022-12-06 05:14:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:46,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284038093] [2022-12-06 05:14:46,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284038093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:46,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:46,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938344054] [2022-12-06 05:14:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:46,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:46,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:14:46,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 101 transitions, 949 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:46,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:46,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:14:46,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:46,821 INFO L130 PetriNetUnfolder]: 1694/2546 cut-off events. [2022-12-06 05:14:46,821 INFO L131 PetriNetUnfolder]: For 9291/9291 co-relation queries the response was YES. [2022-12-06 05:14:46,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10176 conditions, 2546 events. 1694/2546 cut-off events. For 9291/9291 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12221 event pairs, 173 based on Foata normal form. 1/2473 useless extension candidates. Maximal degree in co-relation 8825. Up to 1027 conditions per place. [2022-12-06 05:14:46,839 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 129 selfloop transitions, 48 changer transitions 2/180 dead transitions. [2022-12-06 05:14:46,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 180 transitions, 1603 flow [2022-12-06 05:14:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:14:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:14:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-06 05:14:46,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-06 05:14:46,840 INFO L175 Difference]: Start difference. First operand has 75 places, 101 transitions, 949 flow. Second operand 7 states and 144 transitions. [2022-12-06 05:14:46,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 180 transitions, 1603 flow [2022-12-06 05:14:46,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 180 transitions, 1539 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:46,868 INFO L231 Difference]: Finished difference. Result has 82 places, 109 transitions, 1100 flow [2022-12-06 05:14:46,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1100, PETRI_PLACES=82, PETRI_TRANSITIONS=109} [2022-12-06 05:14:46,869 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 44 predicate places. [2022-12-06 05:14:46,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:46,869 INFO L89 Accepts]: Start accepts. Operand has 82 places, 109 transitions, 1100 flow [2022-12-06 05:14:46,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:46,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:46,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 109 transitions, 1100 flow [2022-12-06 05:14:46,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 109 transitions, 1100 flow [2022-12-06 05:14:46,907 INFO L130 PetriNetUnfolder]: 96/345 cut-off events. [2022-12-06 05:14:46,907 INFO L131 PetriNetUnfolder]: For 1337/1402 co-relation queries the response was YES. [2022-12-06 05:14:46,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 345 events. 96/345 cut-off events. For 1337/1402 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2177 event pairs, 1 based on Foata normal form. 2/310 useless extension candidates. Maximal degree in co-relation 969. Up to 63 conditions per place. [2022-12-06 05:14:46,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 109 transitions, 1100 flow [2022-12-06 05:14:46,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 1130 [2022-12-06 05:14:46,912 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:46,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 05:14:46,912 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 109 transitions, 1100 flow [2022-12-06 05:14:46,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:46,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:46,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:46,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:14:46,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash 722248821, now seen corresponding path program 1 times [2022-12-06 05:14:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:46,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292390842] [2022-12-06 05:14:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:47,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292390842] [2022-12-06 05:14:47,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292390842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:47,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:47,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900600267] [2022-12-06 05:14:47,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:47,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:47,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:14:47,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 109 transitions, 1100 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:47,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:47,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:14:47,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:47,418 INFO L130 PetriNetUnfolder]: 1709/2597 cut-off events. [2022-12-06 05:14:47,418 INFO L131 PetriNetUnfolder]: For 10776/10776 co-relation queries the response was YES. [2022-12-06 05:14:47,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11023 conditions, 2597 events. 1709/2597 cut-off events. For 10776/10776 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12791 event pairs, 311 based on Foata normal form. 1/2514 useless extension candidates. Maximal degree in co-relation 10051. Up to 574 conditions per place. [2022-12-06 05:14:47,429 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 143 selfloop transitions, 56 changer transitions 8/208 dead transitions. [2022-12-06 05:14:47,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 208 transitions, 2051 flow [2022-12-06 05:14:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:14:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:14:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2022-12-06 05:14:47,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-06 05:14:47,431 INFO L175 Difference]: Start difference. First operand has 82 places, 109 transitions, 1100 flow. Second operand 7 states and 145 transitions. [2022-12-06 05:14:47,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 208 transitions, 2051 flow [2022-12-06 05:14:47,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 208 transitions, 1991 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:47,464 INFO L231 Difference]: Finished difference. Result has 89 places, 125 transitions, 1389 flow [2022-12-06 05:14:47,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1389, PETRI_PLACES=89, PETRI_TRANSITIONS=125} [2022-12-06 05:14:47,465 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-06 05:14:47,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:47,465 INFO L89 Accepts]: Start accepts. Operand has 89 places, 125 transitions, 1389 flow [2022-12-06 05:14:47,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:47,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:47,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 125 transitions, 1389 flow [2022-12-06 05:14:47,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 125 transitions, 1389 flow [2022-12-06 05:14:47,491 INFO L130 PetriNetUnfolder]: 103/360 cut-off events. [2022-12-06 05:14:47,491 INFO L131 PetriNetUnfolder]: For 1774/1853 co-relation queries the response was YES. [2022-12-06 05:14:47,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 360 events. 103/360 cut-off events. For 1774/1853 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2272 event pairs, 3 based on Foata normal form. 7/329 useless extension candidates. Maximal degree in co-relation 1121. Up to 69 conditions per place. [2022-12-06 05:14:47,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 125 transitions, 1389 flow [2022-12-06 05:14:47,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 1198 [2022-12-06 05:14:47,496 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:47,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 05:14:47,496 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 125 transitions, 1389 flow [2022-12-06 05:14:47,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:47,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:47,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:47,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:14:47,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1452685032, now seen corresponding path program 1 times [2022-12-06 05:14:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:47,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463704997] [2022-12-06 05:14:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463704997] [2022-12-06 05:14:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463704997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:47,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:47,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611519086] [2022-12-06 05:14:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:47,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:14:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:14:47,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:14:47,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:14:47,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 125 transitions, 1389 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:47,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:47,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:14:47,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:48,647 INFO L130 PetriNetUnfolder]: 5562/8507 cut-off events. [2022-12-06 05:14:48,648 INFO L131 PetriNetUnfolder]: For 49448/49448 co-relation queries the response was YES. [2022-12-06 05:14:48,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38680 conditions, 8507 events. 5562/8507 cut-off events. For 49448/49448 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 51705 event pairs, 1124 based on Foata normal form. 20/8306 useless extension candidates. Maximal degree in co-relation 35014. Up to 1492 conditions per place. [2022-12-06 05:14:48,698 INFO L137 encePairwiseOnDemand]: 32/45 looper letters, 414 selfloop transitions, 81 changer transitions 46/542 dead transitions. [2022-12-06 05:14:48,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 542 transitions, 6692 flow [2022-12-06 05:14:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:14:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:14:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 282 transitions. [2022-12-06 05:14:48,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2022-12-06 05:14:48,700 INFO L175 Difference]: Start difference. First operand has 89 places, 125 transitions, 1389 flow. Second operand 12 states and 282 transitions. [2022-12-06 05:14:48,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 542 transitions, 6692 flow [2022-12-06 05:14:48,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 542 transitions, 6431 flow, removed 126 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:48,986 INFO L231 Difference]: Finished difference. Result has 103 places, 177 transitions, 2227 flow [2022-12-06 05:14:48,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2227, PETRI_PLACES=103, PETRI_TRANSITIONS=177} [2022-12-06 05:14:48,987 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 65 predicate places. [2022-12-06 05:14:48,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:48,987 INFO L89 Accepts]: Start accepts. Operand has 103 places, 177 transitions, 2227 flow [2022-12-06 05:14:48,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:48,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:48,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 177 transitions, 2227 flow [2022-12-06 05:14:48,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 177 transitions, 2227 flow [2022-12-06 05:14:49,058 INFO L130 PetriNetUnfolder]: 274/1040 cut-off events. [2022-12-06 05:14:49,058 INFO L131 PetriNetUnfolder]: For 5096/5294 co-relation queries the response was YES. [2022-12-06 05:14:49,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 1040 events. 274/1040 cut-off events. For 5096/5294 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8874 event pairs, 9 based on Foata normal form. 23/964 useless extension candidates. Maximal degree in co-relation 3320. Up to 158 conditions per place. [2022-12-06 05:14:49,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 177 transitions, 2227 flow [2022-12-06 05:14:49,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 1634 [2022-12-06 05:14:54,421 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:14:54,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5435 [2022-12-06 05:14:54,422 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 177 transitions, 2265 flow [2022-12-06 05:14:54,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:54,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:54,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:14:54,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1963135850, now seen corresponding path program 1 times [2022-12-06 05:14:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:54,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566266851] [2022-12-06 05:14:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566266851] [2022-12-06 05:14:54,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566266851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:54,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:54,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215812198] [2022-12-06 05:14:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:54,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:54,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:54,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:54,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 05:14:54,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 177 transitions, 2265 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:54,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:54,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 05:14:54,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:55,513 INFO L130 PetriNetUnfolder]: 5418/8476 cut-off events. [2022-12-06 05:14:55,513 INFO L131 PetriNetUnfolder]: For 42468/42468 co-relation queries the response was YES. [2022-12-06 05:14:55,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36839 conditions, 8476 events. 5418/8476 cut-off events. For 42468/42468 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 53063 event pairs, 713 based on Foata normal form. 3/8266 useless extension candidates. Maximal degree in co-relation 34075. Up to 2443 conditions per place. [2022-12-06 05:14:55,587 INFO L137 encePairwiseOnDemand]: 30/48 looper letters, 181 selfloop transitions, 123 changer transitions 5/310 dead transitions. [2022-12-06 05:14:55,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 310 transitions, 4166 flow [2022-12-06 05:14:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:14:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:14:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-06 05:14:55,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2022-12-06 05:14:55,588 INFO L175 Difference]: Start difference. First operand has 103 places, 177 transitions, 2265 flow. Second operand 7 states and 142 transitions. [2022-12-06 05:14:55,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 310 transitions, 4166 flow [2022-12-06 05:14:55,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 310 transitions, 4048 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:14:55,790 INFO L231 Difference]: Finished difference. Result has 109 places, 223 transitions, 3318 flow [2022-12-06 05:14:55,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3318, PETRI_PLACES=109, PETRI_TRANSITIONS=223} [2022-12-06 05:14:55,791 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 71 predicate places. [2022-12-06 05:14:55,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:55,791 INFO L89 Accepts]: Start accepts. Operand has 109 places, 223 transitions, 3318 flow [2022-12-06 05:14:55,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:55,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:55,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 223 transitions, 3318 flow [2022-12-06 05:14:55,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 223 transitions, 3318 flow [2022-12-06 05:14:55,912 INFO L130 PetriNetUnfolder]: 317/1218 cut-off events. [2022-12-06 05:14:55,912 INFO L131 PetriNetUnfolder]: For 8108/8497 co-relation queries the response was YES. [2022-12-06 05:14:55,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 1218 events. 317/1218 cut-off events. For 8108/8497 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11003 event pairs, 6 based on Foata normal form. 29/1154 useless extension candidates. Maximal degree in co-relation 4125. Up to 191 conditions per place. [2022-12-06 05:14:55,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 223 transitions, 3318 flow [2022-12-06 05:14:55,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 1802 [2022-12-06 05:14:55,931 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:55,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 05:14:55,932 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 223 transitions, 3318 flow [2022-12-06 05:14:55,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:55,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:55,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:55,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:14:55,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2040974071, now seen corresponding path program 1 times [2022-12-06 05:14:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:55,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844563453] [2022-12-06 05:14:55,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:56,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:56,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844563453] [2022-12-06 05:14:56,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844563453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:56,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:56,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:56,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312665542] [2022-12-06 05:14:56,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:56,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:56,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:56,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:56,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:14:56,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 223 transitions, 3318 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:56,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:56,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:14:56,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:57,082 INFO L130 PetriNetUnfolder]: 5346/8300 cut-off events. [2022-12-06 05:14:57,082 INFO L131 PetriNetUnfolder]: For 47791/47791 co-relation queries the response was YES. [2022-12-06 05:14:57,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38246 conditions, 8300 events. 5346/8300 cut-off events. For 47791/47791 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 50863 event pairs, 1958 based on Foata normal form. 3/8046 useless extension candidates. Maximal degree in co-relation 35298. Up to 5033 conditions per place. [2022-12-06 05:14:57,119 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 220 selfloop transitions, 50 changer transitions 4/275 dead transitions. [2022-12-06 05:14:57,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 275 transitions, 4127 flow [2022-12-06 05:14:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 05:14:57,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-06 05:14:57,121 INFO L175 Difference]: Start difference. First operand has 108 places, 223 transitions, 3318 flow. Second operand 5 states and 105 transitions. [2022-12-06 05:14:57,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 275 transitions, 4127 flow [2022-12-06 05:14:57,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 275 transitions, 4019 flow, removed 54 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:57,359 INFO L231 Difference]: Finished difference. Result has 114 places, 226 transitions, 3424 flow [2022-12-06 05:14:57,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3214, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3424, PETRI_PLACES=114, PETRI_TRANSITIONS=226} [2022-12-06 05:14:57,359 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 76 predicate places. [2022-12-06 05:14:57,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:57,359 INFO L89 Accepts]: Start accepts. Operand has 114 places, 226 transitions, 3424 flow [2022-12-06 05:14:57,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:57,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:57,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 226 transitions, 3424 flow [2022-12-06 05:14:57,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 226 transitions, 3424 flow [2022-12-06 05:14:57,444 INFO L130 PetriNetUnfolder]: 304/1210 cut-off events. [2022-12-06 05:14:57,444 INFO L131 PetriNetUnfolder]: For 8115/8324 co-relation queries the response was YES. [2022-12-06 05:14:57,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1210 events. 304/1210 cut-off events. For 8115/8324 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 11078 event pairs, 3 based on Foata normal form. 30/1156 useless extension candidates. Maximal degree in co-relation 4375. Up to 185 conditions per place. [2022-12-06 05:14:57,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 226 transitions, 3424 flow [2022-12-06 05:14:57,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 1812 [2022-12-06 05:14:57,457 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:57,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 05:14:57,458 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 226 transitions, 3424 flow [2022-12-06 05:14:57,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:57,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:57,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:57,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:14:57,458 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1681893315, now seen corresponding path program 2 times [2022-12-06 05:14:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:57,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109347947] [2022-12-06 05:14:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:57,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109347947] [2022-12-06 05:14:57,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109347947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:57,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:57,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:14:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016270596] [2022-12-06 05:14:57,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:57,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:14:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:14:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:14:57,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:14:57,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 226 transitions, 3424 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:57,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:57,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:14:57,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:58,623 INFO L130 PetriNetUnfolder]: 5244/8117 cut-off events. [2022-12-06 05:14:58,624 INFO L131 PetriNetUnfolder]: For 49451/49451 co-relation queries the response was YES. [2022-12-06 05:14:58,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37603 conditions, 8117 events. 5244/8117 cut-off events. For 49451/49451 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 49109 event pairs, 1296 based on Foata normal form. 3/7878 useless extension candidates. Maximal degree in co-relation 35692. Up to 2868 conditions per place. [2022-12-06 05:14:58,752 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 186 selfloop transitions, 108 changer transitions 4/299 dead transitions. [2022-12-06 05:14:58,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 299 transitions, 4431 flow [2022-12-06 05:14:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:14:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:14:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-12-06 05:14:58,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3860182370820669 [2022-12-06 05:14:58,754 INFO L175 Difference]: Start difference. First operand has 114 places, 226 transitions, 3424 flow. Second operand 7 states and 127 transitions. [2022-12-06 05:14:58,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 299 transitions, 4431 flow [2022-12-06 05:14:58,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 299 transitions, 4379 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:58,990 INFO L231 Difference]: Finished difference. Result has 121 places, 238 transitions, 3850 flow [2022-12-06 05:14:58,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3374, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3850, PETRI_PLACES=121, PETRI_TRANSITIONS=238} [2022-12-06 05:14:58,990 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-06 05:14:58,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:58,991 INFO L89 Accepts]: Start accepts. Operand has 121 places, 238 transitions, 3850 flow [2022-12-06 05:14:58,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:58,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:58,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 238 transitions, 3850 flow [2022-12-06 05:14:58,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 238 transitions, 3850 flow [2022-12-06 05:14:59,106 INFO L130 PetriNetUnfolder]: 315/1206 cut-off events. [2022-12-06 05:14:59,106 INFO L131 PetriNetUnfolder]: For 8793/9009 co-relation queries the response was YES. [2022-12-06 05:14:59,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 1206 events. 315/1206 cut-off events. For 8793/9009 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10882 event pairs, 3 based on Foata normal form. 36/1158 useless extension candidates. Maximal degree in co-relation 4820. Up to 185 conditions per place. [2022-12-06 05:14:59,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 238 transitions, 3850 flow [2022-12-06 05:14:59,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 1812 [2022-12-06 05:14:59,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:59,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 05:14:59,124 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 238 transitions, 3850 flow [2022-12-06 05:14:59,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:59,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:59,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:59,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:14:59,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1206726507, now seen corresponding path program 1 times [2022-12-06 05:14:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748350549] [2022-12-06 05:14:59,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:59,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:59,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:59,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748350549] [2022-12-06 05:14:59,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748350549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:59,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:59,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682205872] [2022-12-06 05:14:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:59,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:59,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:14:59,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 238 transitions, 3850 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:59,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:59,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:14:59,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:00,363 INFO L130 PetriNetUnfolder]: 5226/8045 cut-off events. [2022-12-06 05:15:00,363 INFO L131 PetriNetUnfolder]: For 53101/53101 co-relation queries the response was YES. [2022-12-06 05:15:00,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39325 conditions, 8045 events. 5226/8045 cut-off events. For 53101/53101 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 48422 event pairs, 1506 based on Foata normal form. 3/7791 useless extension candidates. Maximal degree in co-relation 37742. Up to 2680 conditions per place. [2022-12-06 05:15:00,400 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 154 selfloop transitions, 140 changer transitions 6/301 dead transitions. [2022-12-06 05:15:00,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 301 transitions, 4705 flow [2022-12-06 05:15:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-06 05:15:00,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41033434650455924 [2022-12-06 05:15:00,401 INFO L175 Difference]: Start difference. First operand has 121 places, 238 transitions, 3850 flow. Second operand 7 states and 135 transitions. [2022-12-06 05:15:00,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 301 transitions, 4705 flow [2022-12-06 05:15:00,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 301 transitions, 4630 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:00,612 INFO L231 Difference]: Finished difference. Result has 126 places, 238 transitions, 4070 flow [2022-12-06 05:15:00,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3779, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4070, PETRI_PLACES=126, PETRI_TRANSITIONS=238} [2022-12-06 05:15:00,613 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2022-12-06 05:15:00,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:00,613 INFO L89 Accepts]: Start accepts. Operand has 126 places, 238 transitions, 4070 flow [2022-12-06 05:15:00,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:00,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:00,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 238 transitions, 4070 flow [2022-12-06 05:15:00,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 238 transitions, 4070 flow [2022-12-06 05:15:00,700 INFO L130 PetriNetUnfolder]: 309/1179 cut-off events. [2022-12-06 05:15:00,700 INFO L131 PetriNetUnfolder]: For 10091/10315 co-relation queries the response was YES. [2022-12-06 05:15:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 1179 events. 309/1179 cut-off events. For 10091/10315 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10531 event pairs, 3 based on Foata normal form. 35/1133 useless extension candidates. Maximal degree in co-relation 4804. Up to 185 conditions per place. [2022-12-06 05:15:00,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 238 transitions, 4070 flow [2022-12-06 05:15:00,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 1806 [2022-12-06 05:15:00,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L89-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_25| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_25| 0)) (.cse2 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_61 256)))) (or (and (= v_~n1~0_108 (+ v_~res3~0_76 v_~n3~0_102)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= v_~res3~0_78 v_~res3~0_76) (not .cse2)))) (let ((.cse6 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n1~0_108))) (or (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse3 (select (select |v_#memory_int_332| v_~get1~0.base_91) (+ v_~get1~0.offset_91 .cse7))) (.cse4 (select (select |v_#memory_int_332| v_~get3~0.base_95) (+ v_~get3~0.offset_95 .cse7)))) (and (not (= .cse3 .cse4)) .cse5 (= v_thread3Thread1of1ForFork2_~stop~2_61 1) (= v_~res3~0_78 (ite (< .cse3 .cse4) (- 1) 1)) .cse6))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_68| |v_thread3Thread1of1ForFork2_#t~mem12_67|) (or (not .cse6) (not .cse5)) (= |v_thread3Thread1of1ForFork2_#t~mem15_50| |v_thread3Thread1of1ForFork2_#t~mem15_49|) (= |v_thread3Thread1of1ForFork2_#t~mem13_70| |v_thread3Thread1of1ForFork2_#t~mem13_69|) (= v_~res3~0_78 v_~res3~0_77) (= |v_thread3Thread1of1ForFork2_#t~mem14_54| |v_thread3Thread1of1ForFork2_#t~mem14_53|) (= v_thread3Thread1of1ForFork2_~stop~2_62 v_thread3Thread1of1ForFork2_~stop~2_61)))) (= v_~res1~0_74 (ite (< v_~count2~0_61 v_~count1~0_69) 1 (- 1))) (not (= v_~count1~0_69 v_~count2~0_61)) (= v_thread1Thread1of1ForFork0_~stop~0_51 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_70|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_68|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_50|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_54|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_62, #memory_int=|v_#memory_int_332|, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_77} OutVars{~res1~0=v_~res1~0_74, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_69|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_67|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_25|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_25|, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_49|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_53|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_61, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_51, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_76} AuxVars[v_~res3~0_78] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork0_~stop~0, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:00,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,079 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L89-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_25| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_25| 0)) (.cse2 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_61 256)))) (or (and (= v_~n1~0_108 (+ v_~res3~0_76 v_~n3~0_102)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= v_~res3~0_78 v_~res3~0_76) (not .cse2)))) (let ((.cse6 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n1~0_108))) (or (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse3 (select (select |v_#memory_int_332| v_~get1~0.base_91) (+ v_~get1~0.offset_91 .cse7))) (.cse4 (select (select |v_#memory_int_332| v_~get3~0.base_95) (+ v_~get3~0.offset_95 .cse7)))) (and (not (= .cse3 .cse4)) .cse5 (= v_thread3Thread1of1ForFork2_~stop~2_61 1) (= v_~res3~0_78 (ite (< .cse3 .cse4) (- 1) 1)) .cse6))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_68| |v_thread3Thread1of1ForFork2_#t~mem12_67|) (or (not .cse6) (not .cse5)) (= |v_thread3Thread1of1ForFork2_#t~mem15_50| |v_thread3Thread1of1ForFork2_#t~mem15_49|) (= |v_thread3Thread1of1ForFork2_#t~mem13_70| |v_thread3Thread1of1ForFork2_#t~mem13_69|) (= v_~res3~0_78 v_~res3~0_77) (= |v_thread3Thread1of1ForFork2_#t~mem14_54| |v_thread3Thread1of1ForFork2_#t~mem14_53|) (= v_thread3Thread1of1ForFork2_~stop~2_62 v_thread3Thread1of1ForFork2_~stop~2_61)))) (= v_~res1~0_74 (ite (< v_~count2~0_61 v_~count1~0_69) 1 (- 1))) (not (= v_~count1~0_69 v_~count2~0_61)) (= v_thread1Thread1of1ForFork0_~stop~0_51 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_70|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_68|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_50|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_54|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_62, #memory_int=|v_#memory_int_332|, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_77} OutVars{~res1~0=v_~res1~0_74, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_69|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_67|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_25|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_25|, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_49|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_53|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_61, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_51, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_76} AuxVars[v_~res3~0_78] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork0_~stop~0, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,889 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:01,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:02,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:02,062 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:02,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] L89-6-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_27| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_27| 0) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_25| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_25| 0)) (.cse2 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_61 256)))) (or (and (= v_~n1~0_108 (+ v_~res3~0_76 v_~n3~0_102)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= v_~res3~0_78 v_~res3~0_76) (not .cse2)))) (let ((.cse6 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n1~0_108))) (or (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse3 (select (select |v_#memory_int_332| v_~get1~0.base_91) (+ v_~get1~0.offset_91 .cse7))) (.cse4 (select (select |v_#memory_int_332| v_~get3~0.base_95) (+ v_~get3~0.offset_95 .cse7)))) (and (not (= .cse3 .cse4)) .cse5 (= v_thread3Thread1of1ForFork2_~stop~2_61 1) (= v_~res3~0_78 (ite (< .cse3 .cse4) (- 1) 1)) .cse6))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_68| |v_thread3Thread1of1ForFork2_#t~mem12_67|) (or (not .cse6) (not .cse5)) (= |v_thread3Thread1of1ForFork2_#t~mem15_50| |v_thread3Thread1of1ForFork2_#t~mem15_49|) (= |v_thread3Thread1of1ForFork2_#t~mem13_70| |v_thread3Thread1of1ForFork2_#t~mem13_69|) (= v_~res3~0_78 v_~res3~0_77) (= |v_thread3Thread1of1ForFork2_#t~mem14_54| |v_thread3Thread1of1ForFork2_#t~mem14_53|) (= v_thread3Thread1of1ForFork2_~stop~2_62 v_thread3Thread1of1ForFork2_~stop~2_61)))) (= v_~res1~0_74 (ite (< v_~count2~0_61 v_~count1~0_69) 1 (- 1))) (not (= v_~count1~0_69 v_~count2~0_61)) (= v_thread1Thread1of1ForFork0_~stop~0_51 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_70|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_68|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_50|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_54|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_62, #memory_int=|v_#memory_int_332|, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_77} OutVars{~res1~0=v_~res1~0_74, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_69|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_67|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_27|, ~get3~0.base=v_~get3~0.base_95, ~n3~0=v_~n3~0_102, ~count2~0=v_~count2~0_61, ~n1~0=v_~n1~0_108, ~count1~0=v_~count1~0_69, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_25|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_27|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_25|, ~get3~0.offset=v_~get3~0.offset_95, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_49|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_53|, ~get1~0.base=v_~get1~0.base_91, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_61, #memory_int=|v_#memory_int_332|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_51, ~get1~0.offset=v_~get1~0.offset_91, ~res3~0=v_~res3~0_76} AuxVars[v_~res3~0_78] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork0_~stop~0, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:02,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:02,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_11| 0) (= v_thread1Thread1of1ForFork0_~stop~0_29 0) (= |v_thread1Thread1of1ForFork0_#res.base_11| 0) (= (ite (< v_~count2~0_51 v_~count1~0_59) 1 (- 1)) v_~res1~0_42) (not (= v_~count1~0_59 v_~count2~0_51))) InVars {~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59} OutVars{~res1~0=v_~res1~0_42, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_11|, ~count2~0=v_~count2~0_51, ~count1~0=v_~count1~0_59, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_11|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_29} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] and [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:02,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:02,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1820 [2022-12-06 05:15:02,433 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 260 transitions, 5153 flow [2022-12-06 05:15:02,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:02,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:02,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:02,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:15:02,433 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1218545451, now seen corresponding path program 3 times [2022-12-06 05:15:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:02,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306053582] [2022-12-06 05:15:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:02,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:02,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306053582] [2022-12-06 05:15:02,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306053582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:02,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:02,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:02,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731110900] [2022-12-06 05:15:02,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:02,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:02,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:02,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:02,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 71 [2022-12-06 05:15:02,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 260 transitions, 5153 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:02,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:02,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 71 [2022-12-06 05:15:02,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:03,706 INFO L130 PetriNetUnfolder]: 6014/9600 cut-off events. [2022-12-06 05:15:03,706 INFO L131 PetriNetUnfolder]: For 73387/73387 co-relation queries the response was YES. [2022-12-06 05:15:03,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46026 conditions, 9600 events. 6014/9600 cut-off events. For 73387/73387 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 63145 event pairs, 384 based on Foata normal form. 6/9340 useless extension candidates. Maximal degree in co-relation 43737. Up to 3092 conditions per place. [2022-12-06 05:15:03,757 INFO L137 encePairwiseOnDemand]: 50/71 looper letters, 270 selfloop transitions, 152 changer transitions 9/432 dead transitions. [2022-12-06 05:15:03,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 432 transitions, 6889 flow [2022-12-06 05:15:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:15:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:15:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2022-12-06 05:15:03,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31768388106416273 [2022-12-06 05:15:03,759 INFO L175 Difference]: Start difference. First operand has 127 places, 260 transitions, 5153 flow. Second operand 9 states and 203 transitions. [2022-12-06 05:15:03,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 432 transitions, 6889 flow [2022-12-06 05:15:03,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 432 transitions, 6331 flow, removed 75 selfloop flow, removed 4 redundant places. [2022-12-06 05:15:03,985 INFO L231 Difference]: Finished difference. Result has 135 places, 285 transitions, 4938 flow [2022-12-06 05:15:03,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=3728, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4938, PETRI_PLACES=135, PETRI_TRANSITIONS=285} [2022-12-06 05:15:03,985 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 97 predicate places. [2022-12-06 05:15:03,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:03,986 INFO L89 Accepts]: Start accepts. Operand has 135 places, 285 transitions, 4938 flow [2022-12-06 05:15:03,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:03,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:03,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 285 transitions, 4938 flow [2022-12-06 05:15:03,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 285 transitions, 4938 flow [2022-12-06 05:15:04,103 INFO L130 PetriNetUnfolder]: 401/1637 cut-off events. [2022-12-06 05:15:04,103 INFO L131 PetriNetUnfolder]: For 13337/13624 co-relation queries the response was YES. [2022-12-06 05:15:04,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 1637 events. 401/1637 cut-off events. For 13337/13624 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16102 event pairs, 3 based on Foata normal form. 52/1603 useless extension candidates. Maximal degree in co-relation 6640. Up to 243 conditions per place. [2022-12-06 05:15:04,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 285 transitions, 4938 flow [2022-12-06 05:15:04,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 2116 [2022-12-06 05:15:04,122 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:04,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 05:15:04,123 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 285 transitions, 4938 flow [2022-12-06 05:15:04,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:04,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:04,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:04,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:15:04,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:04,123 INFO L85 PathProgramCache]: Analyzing trace with hash 538423394, now seen corresponding path program 1 times [2022-12-06 05:15:04,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:04,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859699914] [2022-12-06 05:15:04,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:04,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859699914] [2022-12-06 05:15:04,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859699914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:04,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:04,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:15:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140462823] [2022-12-06 05:15:04,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:04,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:04,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 05:15:04,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 285 transitions, 4938 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-06 05:15:04,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:04,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 05:15:04,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:05,258 INFO L130 PetriNetUnfolder]: 5945/9365 cut-off events. [2022-12-06 05:15:05,258 INFO L131 PetriNetUnfolder]: For 73466/73466 co-relation queries the response was YES. [2022-12-06 05:15:05,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46591 conditions, 9365 events. 5945/9365 cut-off events. For 73466/73466 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 59859 event pairs, 954 based on Foata normal form. 3/9081 useless extension candidates. Maximal degree in co-relation 44215. Up to 4491 conditions per place. [2022-12-06 05:15:05,314 INFO L137 encePairwiseOnDemand]: 33/50 looper letters, 266 selfloop transitions, 91 changer transitions 9/367 dead transitions. [2022-12-06 05:15:05,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 367 transitions, 6353 flow [2022-12-06 05:15:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-06 05:15:05,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.488 [2022-12-06 05:15:05,315 INFO L175 Difference]: Start difference. First operand has 135 places, 285 transitions, 4938 flow. Second operand 5 states and 122 transitions. [2022-12-06 05:15:05,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 367 transitions, 6353 flow [2022-12-06 05:15:05,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 367 transitions, 6141 flow, removed 106 selfloop flow, removed 0 redundant places. [2022-12-06 05:15:05,739 INFO L231 Difference]: Finished difference. Result has 140 places, 281 transitions, 4946 flow [2022-12-06 05:15:05,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4842, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4946, PETRI_PLACES=140, PETRI_TRANSITIONS=281} [2022-12-06 05:15:05,740 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2022-12-06 05:15:05,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:05,740 INFO L89 Accepts]: Start accepts. Operand has 140 places, 281 transitions, 4946 flow [2022-12-06 05:15:05,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:05,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:05,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 281 transitions, 4946 flow [2022-12-06 05:15:05,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 281 transitions, 4946 flow [2022-12-06 05:15:05,872 INFO L130 PetriNetUnfolder]: 423/1599 cut-off events. [2022-12-06 05:15:05,872 INFO L131 PetriNetUnfolder]: For 14259/14527 co-relation queries the response was YES. [2022-12-06 05:15:05,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 1599 events. 423/1599 cut-off events. For 14259/14527 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15163 event pairs, 0 based on Foata normal form. 54/1564 useless extension candidates. Maximal degree in co-relation 7059. Up to 266 conditions per place. [2022-12-06 05:15:05,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 281 transitions, 4946 flow [2022-12-06 05:15:05,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 2094 [2022-12-06 05:15:05,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:05,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 05:15:05,894 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 281 transitions, 4946 flow [2022-12-06 05:15:05,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-06 05:15:05,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:05,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:05,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:15:05,894 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1844788331, now seen corresponding path program 1 times [2022-12-06 05:15:05,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:05,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946264277] [2022-12-06 05:15:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:05,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:05,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946264277] [2022-12-06 05:15:05,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946264277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:05,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:05,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852328460] [2022-12-06 05:15:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:05,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:05,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:05,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 281 transitions, 4946 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:05,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:05,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:05,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:07,091 INFO L130 PetriNetUnfolder]: 5678/9095 cut-off events. [2022-12-06 05:15:07,092 INFO L131 PetriNetUnfolder]: For 82525/82525 co-relation queries the response was YES. [2022-12-06 05:15:07,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45215 conditions, 9095 events. 5678/9095 cut-off events. For 82525/82525 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 59628 event pairs, 1147 based on Foata normal form. 46/8871 useless extension candidates. Maximal degree in co-relation 43905. Up to 6324 conditions per place. [2022-12-06 05:15:07,137 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 269 selfloop transitions, 44 changer transitions 0/314 dead transitions. [2022-12-06 05:15:07,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 314 transitions, 5575 flow [2022-12-06 05:15:07,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 05:15:07,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:15:07,138 INFO L175 Difference]: Start difference. First operand has 139 places, 281 transitions, 4946 flow. Second operand 4 states and 94 transitions. [2022-12-06 05:15:07,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 314 transitions, 5575 flow [2022-12-06 05:15:07,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 314 transitions, 5220 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 05:15:07,400 INFO L231 Difference]: Finished difference. Result has 139 places, 275 transitions, 4532 flow [2022-12-06 05:15:07,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4308, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4532, PETRI_PLACES=139, PETRI_TRANSITIONS=275} [2022-12-06 05:15:07,400 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 101 predicate places. [2022-12-06 05:15:07,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:07,401 INFO L89 Accepts]: Start accepts. Operand has 139 places, 275 transitions, 4532 flow [2022-12-06 05:15:07,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:07,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:07,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 275 transitions, 4532 flow [2022-12-06 05:15:07,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 275 transitions, 4532 flow [2022-12-06 05:15:07,521 INFO L130 PetriNetUnfolder]: 408/1561 cut-off events. [2022-12-06 05:15:07,521 INFO L131 PetriNetUnfolder]: For 11008/11248 co-relation queries the response was YES. [2022-12-06 05:15:07,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 1561 events. 408/1561 cut-off events. For 11008/11248 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14757 event pairs, 0 based on Foata normal form. 48/1520 useless extension candidates. Maximal degree in co-relation 6648. Up to 260 conditions per place. [2022-12-06 05:15:07,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 275 transitions, 4532 flow [2022-12-06 05:15:07,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 2002 [2022-12-06 05:15:07,540 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:07,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 05:15:07,541 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 275 transitions, 4532 flow [2022-12-06 05:15:07,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:07,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:07,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:07,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:15:07,541 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash -380477884, now seen corresponding path program 1 times [2022-12-06 05:15:07,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:07,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197181554] [2022-12-06 05:15:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:07,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:07,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197181554] [2022-12-06 05:15:07,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197181554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:07,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:07,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724620653] [2022-12-06 05:15:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:07,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:07,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:07,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 275 transitions, 4532 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:07,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:07,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:07,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:08,799 INFO L130 PetriNetUnfolder]: 5698/9066 cut-off events. [2022-12-06 05:15:08,800 INFO L131 PetriNetUnfolder]: For 69167/69167 co-relation queries the response was YES. [2022-12-06 05:15:08,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44632 conditions, 9066 events. 5698/9066 cut-off events. For 69167/69167 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 58417 event pairs, 2252 based on Foata normal form. 3/8757 useless extension candidates. Maximal degree in co-relation 43304. Up to 6913 conditions per place. [2022-12-06 05:15:08,854 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 294 selfloop transitions, 24 changer transitions 11/330 dead transitions. [2022-12-06 05:15:08,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 330 transitions, 5513 flow [2022-12-06 05:15:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-06 05:15:08,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43829787234042555 [2022-12-06 05:15:08,855 INFO L175 Difference]: Start difference. First operand has 139 places, 275 transitions, 4532 flow. Second operand 5 states and 103 transitions. [2022-12-06 05:15:08,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 330 transitions, 5513 flow [2022-12-06 05:15:09,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 330 transitions, 5501 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 05:15:09,123 INFO L231 Difference]: Finished difference. Result has 145 places, 276 transitions, 4547 flow [2022-12-06 05:15:09,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4520, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4547, PETRI_PLACES=145, PETRI_TRANSITIONS=276} [2022-12-06 05:15:09,124 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2022-12-06 05:15:09,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:09,124 INFO L89 Accepts]: Start accepts. Operand has 145 places, 276 transitions, 4547 flow [2022-12-06 05:15:09,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:09,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:09,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 276 transitions, 4547 flow [2022-12-06 05:15:09,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 276 transitions, 4547 flow [2022-12-06 05:15:09,262 INFO L130 PetriNetUnfolder]: 407/1535 cut-off events. [2022-12-06 05:15:09,263 INFO L131 PetriNetUnfolder]: For 11350/11599 co-relation queries the response was YES. [2022-12-06 05:15:09,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 1535 events. 407/1535 cut-off events. For 11350/11599 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14411 event pairs, 0 based on Foata normal form. 57/1503 useless extension candidates. Maximal degree in co-relation 6712. Up to 260 conditions per place. [2022-12-06 05:15:09,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 276 transitions, 4547 flow [2022-12-06 05:15:09,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 1990 [2022-12-06 05:15:09,282 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:15:09,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:15:09,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (= v_~res2~0_24 (ite (< v_~count3~0_39 v_~count2~0_27) 1 (- 1))) (= v_thread2Thread1of1ForFork1_~stop~1_25 0) (not (= v_~count2~0_27 v_~count3~0_39))) InVars {~count3~0=v_~count3~0_39, ~count2~0=v_~count2~0_27} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, ~count3~0=v_~count3~0_39, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_25, ~count2~0=v_~count2~0_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~res2~0=v_~res2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:15:09,389 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:09,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 05:15:09,389 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 279 transitions, 4641 flow [2022-12-06 05:15:09,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:09,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:09,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:09,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:15:09,390 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash 439942311, now seen corresponding path program 2 times [2022-12-06 05:15:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:09,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068456814] [2022-12-06 05:15:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:09,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068456814] [2022-12-06 05:15:09,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068456814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:09,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:09,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:09,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186767900] [2022-12-06 05:15:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:09,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:09,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:09,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:09,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 05:15:09,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 279 transitions, 4641 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:09,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:09,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 05:15:09,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:10,456 INFO L130 PetriNetUnfolder]: 5412/8741 cut-off events. [2022-12-06 05:15:10,456 INFO L131 PetriNetUnfolder]: For 67268/67268 co-relation queries the response was YES. [2022-12-06 05:15:10,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42938 conditions, 8741 events. 5412/8741 cut-off events. For 67268/67268 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 57413 event pairs, 1387 based on Foata normal form. 46/8493 useless extension candidates. Maximal degree in co-relation 41601. Up to 6534 conditions per place. [2022-12-06 05:15:10,502 INFO L137 encePairwiseOnDemand]: 45/50 looper letters, 260 selfloop transitions, 56 changer transitions 0/317 dead transitions. [2022-12-06 05:15:10,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 317 transitions, 5321 flow [2022-12-06 05:15:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 05:15:10,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 05:15:10,503 INFO L175 Difference]: Start difference. First operand has 145 places, 279 transitions, 4641 flow. Second operand 4 states and 94 transitions. [2022-12-06 05:15:10,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 317 transitions, 5321 flow [2022-12-06 05:15:10,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 317 transitions, 5221 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-06 05:15:10,759 INFO L231 Difference]: Finished difference. Result has 148 places, 277 transitions, 4494 flow [2022-12-06 05:15:10,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4146, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4494, PETRI_PLACES=148, PETRI_TRANSITIONS=277} [2022-12-06 05:15:10,759 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2022-12-06 05:15:10,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:10,759 INFO L89 Accepts]: Start accepts. Operand has 148 places, 277 transitions, 4494 flow [2022-12-06 05:15:10,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:10,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:10,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 277 transitions, 4494 flow [2022-12-06 05:15:10,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 277 transitions, 4494 flow [2022-12-06 05:15:10,875 INFO L130 PetriNetUnfolder]: 377/1514 cut-off events. [2022-12-06 05:15:10,875 INFO L131 PetriNetUnfolder]: For 11136/11618 co-relation queries the response was YES. [2022-12-06 05:15:10,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 1514 events. 377/1514 cut-off events. For 11136/11618 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14379 event pairs, 0 based on Foata normal form. 67/1492 useless extension candidates. Maximal degree in co-relation 6347. Up to 236 conditions per place. [2022-12-06 05:15:10,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 277 transitions, 4494 flow [2022-12-06 05:15:10,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 1938 [2022-12-06 05:15:10,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:10,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 05:15:10,894 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 277 transitions, 4494 flow [2022-12-06 05:15:10,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:10,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:10,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:10,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:15:10,894 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -482826724, now seen corresponding path program 2 times [2022-12-06 05:15:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:10,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178694628] [2022-12-06 05:15:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:10,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178694628] [2022-12-06 05:15:10,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178694628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:10,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:10,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:15:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219710665] [2022-12-06 05:15:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:10,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:10,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:10,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 277 transitions, 4494 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:10,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:10,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:10,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:12,332 INFO L130 PetriNetUnfolder]: 7084/11339 cut-off events. [2022-12-06 05:15:12,332 INFO L131 PetriNetUnfolder]: For 88184/88184 co-relation queries the response was YES. [2022-12-06 05:15:12,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57001 conditions, 11339 events. 7084/11339 cut-off events. For 88184/88184 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 76369 event pairs, 2020 based on Foata normal form. 18/10996 useless extension candidates. Maximal degree in co-relation 55833. Up to 6451 conditions per place. [2022-12-06 05:15:12,407 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 403 selfloop transitions, 135 changer transitions 7/546 dead transitions. [2022-12-06 05:15:12,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 546 transitions, 9210 flow [2022-12-06 05:15:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2022-12-06 05:15:12,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5283687943262412 [2022-12-06 05:15:12,409 INFO L175 Difference]: Start difference. First operand has 148 places, 277 transitions, 4494 flow. Second operand 6 states and 149 transitions. [2022-12-06 05:15:12,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 546 transitions, 9210 flow [2022-12-06 05:15:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 546 transitions, 9071 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 05:15:12,768 INFO L231 Difference]: Finished difference. Result has 155 places, 380 transitions, 6636 flow [2022-12-06 05:15:12,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4418, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6636, PETRI_PLACES=155, PETRI_TRANSITIONS=380} [2022-12-06 05:15:12,769 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2022-12-06 05:15:12,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:12,769 INFO L89 Accepts]: Start accepts. Operand has 155 places, 380 transitions, 6636 flow [2022-12-06 05:15:12,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:12,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:12,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 380 transitions, 6636 flow [2022-12-06 05:15:12,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 380 transitions, 6636 flow [2022-12-06 05:15:12,943 INFO L130 PetriNetUnfolder]: 511/1895 cut-off events. [2022-12-06 05:15:12,943 INFO L131 PetriNetUnfolder]: For 15687/15992 co-relation queries the response was YES. [2022-12-06 05:15:12,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9410 conditions, 1895 events. 511/1895 cut-off events. For 15687/15992 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 18459 event pairs, 0 based on Foata normal form. 83/1870 useless extension candidates. Maximal degree in co-relation 9097. Up to 319 conditions per place. [2022-12-06 05:15:12,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 380 transitions, 6636 flow [2022-12-06 05:15:12,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 2818 [2022-12-06 05:15:18,388 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:15:18,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5620 [2022-12-06 05:15:18,389 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 379 transitions, 6651 flow [2022-12-06 05:15:18,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:18,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:18,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:18,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:15:18,389 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 591303418, now seen corresponding path program 1 times [2022-12-06 05:15:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:18,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096537711] [2022-12-06 05:15:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:18,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:18,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096537711] [2022-12-06 05:15:18,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096537711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:18,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:18,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319206691] [2022-12-06 05:15:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:18,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:15:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:15:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:18,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 05:15:18,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 379 transitions, 6651 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:18,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:18,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 05:15:18,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:20,371 INFO L130 PetriNetUnfolder]: 7604/12650 cut-off events. [2022-12-06 05:15:20,372 INFO L131 PetriNetUnfolder]: For 106512/106512 co-relation queries the response was YES. [2022-12-06 05:15:20,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65953 conditions, 12650 events. 7604/12650 cut-off events. For 106512/106512 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 90882 event pairs, 1784 based on Foata normal form. 18/12246 useless extension candidates. Maximal degree in co-relation 64446. Up to 3766 conditions per place. [2022-12-06 05:15:20,447 INFO L137 encePairwiseOnDemand]: 36/48 looper letters, 424 selfloop transitions, 101 changer transitions 57/583 dead transitions. [2022-12-06 05:15:20,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 583 transitions, 10186 flow [2022-12-06 05:15:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-12-06 05:15:20,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2022-12-06 05:15:20,449 INFO L175 Difference]: Start difference. First operand has 154 places, 379 transitions, 6651 flow. Second operand 7 states and 164 transitions. [2022-12-06 05:15:20,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 583 transitions, 10186 flow [2022-12-06 05:15:20,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 583 transitions, 10172 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 05:15:20,932 INFO L231 Difference]: Finished difference. Result has 161 places, 351 transitions, 6396 flow [2022-12-06 05:15:20,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6637, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6396, PETRI_PLACES=161, PETRI_TRANSITIONS=351} [2022-12-06 05:15:20,933 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2022-12-06 05:15:20,933 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:20,933 INFO L89 Accepts]: Start accepts. Operand has 161 places, 351 transitions, 6396 flow [2022-12-06 05:15:20,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:20,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:20,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 351 transitions, 6396 flow [2022-12-06 05:15:20,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 351 transitions, 6396 flow [2022-12-06 05:15:21,098 INFO L130 PetriNetUnfolder]: 432/1937 cut-off events. [2022-12-06 05:15:21,099 INFO L131 PetriNetUnfolder]: For 16712/17027 co-relation queries the response was YES. [2022-12-06 05:15:21,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9397 conditions, 1937 events. 432/1937 cut-off events. For 16712/17027 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20010 event pairs, 0 based on Foata normal form. 85/1912 useless extension candidates. Maximal degree in co-relation 9077. Up to 294 conditions per place. [2022-12-06 05:15:21,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 351 transitions, 6396 flow [2022-12-06 05:15:21,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 2584 [2022-12-06 05:15:21,125 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:21,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:15:21,126 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 351 transitions, 6396 flow [2022-12-06 05:15:21,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:21,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:21,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:21,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:15:21,126 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1519625511, now seen corresponding path program 4 times [2022-12-06 05:15:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:21,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742626875] [2022-12-06 05:15:21,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:21,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742626875] [2022-12-06 05:15:21,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742626875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:21,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:21,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:21,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554074550] [2022-12-06 05:15:21,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:21,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:21,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 05:15:21,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 351 transitions, 6396 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:21,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:21,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 05:15:21,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:23,091 INFO L130 PetriNetUnfolder]: 8252/13283 cut-off events. [2022-12-06 05:15:23,091 INFO L131 PetriNetUnfolder]: For 115004/115004 co-relation queries the response was YES. [2022-12-06 05:15:23,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70280 conditions, 13283 events. 8252/13283 cut-off events. For 115004/115004 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 92390 event pairs, 486 based on Foata normal form. 8/12811 useless extension candidates. Maximal degree in co-relation 68665. Up to 3262 conditions per place. [2022-12-06 05:15:23,194 INFO L137 encePairwiseOnDemand]: 29/48 looper letters, 321 selfloop transitions, 215 changer transitions 15/552 dead transitions. [2022-12-06 05:15:23,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 552 transitions, 9548 flow [2022-12-06 05:15:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:15:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:15:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2022-12-06 05:15:23,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-06 05:15:23,197 INFO L175 Difference]: Start difference. First operand has 161 places, 351 transitions, 6396 flow. Second operand 9 states and 208 transitions. [2022-12-06 05:15:23,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 552 transitions, 9548 flow [2022-12-06 05:15:23,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 552 transitions, 9308 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 05:15:23,678 INFO L231 Difference]: Finished difference. Result has 169 places, 379 transitions, 7394 flow [2022-12-06 05:15:23,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6243, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7394, PETRI_PLACES=169, PETRI_TRANSITIONS=379} [2022-12-06 05:15:23,678 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 131 predicate places. [2022-12-06 05:15:23,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:23,678 INFO L89 Accepts]: Start accepts. Operand has 169 places, 379 transitions, 7394 flow [2022-12-06 05:15:23,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:23,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:23,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 379 transitions, 7394 flow [2022-12-06 05:15:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 379 transitions, 7394 flow [2022-12-06 05:15:23,862 INFO L130 PetriNetUnfolder]: 486/2032 cut-off events. [2022-12-06 05:15:23,863 INFO L131 PetriNetUnfolder]: For 20836/21176 co-relation queries the response was YES. [2022-12-06 05:15:23,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10060 conditions, 2032 events. 486/2032 cut-off events. For 20836/21176 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20763 event pairs, 0 based on Foata normal form. 101/2013 useless extension candidates. Maximal degree in co-relation 9751. Up to 298 conditions per place. [2022-12-06 05:15:23,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 379 transitions, 7394 flow [2022-12-06 05:15:23,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-06 05:15:23,895 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:23,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 05:15:23,896 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 379 transitions, 7394 flow [2022-12-06 05:15:23,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:23,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:23,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:23,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:15:23,896 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:23,896 INFO L85 PathProgramCache]: Analyzing trace with hash -903993484, now seen corresponding path program 1 times [2022-12-06 05:15:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:23,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645445358] [2022-12-06 05:15:23,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:23,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:23,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645445358] [2022-12-06 05:15:23,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645445358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:23,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:23,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416390241] [2022-12-06 05:15:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:23,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:23,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:23,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:23,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-06 05:15:23,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 379 transitions, 7394 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:23,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:23,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-06 05:15:23,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:25,568 INFO L130 PetriNetUnfolder]: 7468/11886 cut-off events. [2022-12-06 05:15:25,568 INFO L131 PetriNetUnfolder]: For 134689/134689 co-relation queries the response was YES. [2022-12-06 05:15:25,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67542 conditions, 11886 events. 7468/11886 cut-off events. For 134689/134689 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 79590 event pairs, 1014 based on Foata normal form. 80/11512 useless extension candidates. Maximal degree in co-relation 66154. Up to 6806 conditions per place. [2022-12-06 05:15:25,657 INFO L137 encePairwiseOnDemand]: 40/48 looper letters, 351 selfloop transitions, 77 changer transitions 9/438 dead transitions. [2022-12-06 05:15:25,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 438 transitions, 8718 flow [2022-12-06 05:15:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-06 05:15:25,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2022-12-06 05:15:25,658 INFO L175 Difference]: Start difference. First operand has 169 places, 379 transitions, 7394 flow. Second operand 5 states and 107 transitions. [2022-12-06 05:15:25,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 438 transitions, 8718 flow [2022-12-06 05:15:26,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 438 transitions, 8444 flow, removed 70 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:26,568 INFO L231 Difference]: Finished difference. Result has 170 places, 367 transitions, 7037 flow [2022-12-06 05:15:26,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6812, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7037, PETRI_PLACES=170, PETRI_TRANSITIONS=367} [2022-12-06 05:15:26,568 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2022-12-06 05:15:26,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:26,569 INFO L89 Accepts]: Start accepts. Operand has 170 places, 367 transitions, 7037 flow [2022-12-06 05:15:26,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:26,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:26,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 367 transitions, 7037 flow [2022-12-06 05:15:26,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 367 transitions, 7037 flow [2022-12-06 05:15:26,832 INFO L130 PetriNetUnfolder]: 442/1866 cut-off events. [2022-12-06 05:15:26,833 INFO L131 PetriNetUnfolder]: For 19262/19682 co-relation queries the response was YES. [2022-12-06 05:15:26,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9157 conditions, 1866 events. 442/1866 cut-off events. For 19262/19682 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18632 event pairs, 0 based on Foata normal form. 99/1863 useless extension candidates. Maximal degree in co-relation 8853. Up to 278 conditions per place. [2022-12-06 05:15:26,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 367 transitions, 7037 flow [2022-12-06 05:15:26,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 2732 [2022-12-06 05:15:26,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:26,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-06 05:15:26,858 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 367 transitions, 7037 flow [2022-12-06 05:15:26,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:26,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:26,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:26,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:15:26,858 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1710776851, now seen corresponding path program 5 times [2022-12-06 05:15:26,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:26,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262099200] [2022-12-06 05:15:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:26,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:26,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262099200] [2022-12-06 05:15:26,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262099200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:26,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:26,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:26,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991730914] [2022-12-06 05:15:26,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:26,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:26,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:26,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:26,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:26,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 367 transitions, 7037 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:26,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:26,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:28,612 INFO L130 PetriNetUnfolder]: 7428/11797 cut-off events. [2022-12-06 05:15:28,612 INFO L131 PetriNetUnfolder]: For 125056/125056 co-relation queries the response was YES. [2022-12-06 05:15:28,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66726 conditions, 11797 events. 7428/11797 cut-off events. For 125056/125056 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 78351 event pairs, 1280 based on Foata normal form. 4/11332 useless extension candidates. Maximal degree in co-relation 65093. Up to 4128 conditions per place. [2022-12-06 05:15:28,690 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 257 selfloop transitions, 152 changer transitions 17/427 dead transitions. [2022-12-06 05:15:28,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 427 transitions, 8199 flow [2022-12-06 05:15:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-06 05:15:28,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4326241134751773 [2022-12-06 05:15:28,691 INFO L175 Difference]: Start difference. First operand has 169 places, 367 transitions, 7037 flow. Second operand 6 states and 122 transitions. [2022-12-06 05:15:28,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 427 transitions, 8199 flow [2022-12-06 05:15:29,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 427 transitions, 7921 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:29,413 INFO L231 Difference]: Finished difference. Result has 170 places, 363 transitions, 7068 flow [2022-12-06 05:15:29,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6762, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7068, PETRI_PLACES=170, PETRI_TRANSITIONS=363} [2022-12-06 05:15:29,414 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2022-12-06 05:15:29,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:29,414 INFO L89 Accepts]: Start accepts. Operand has 170 places, 363 transitions, 7068 flow [2022-12-06 05:15:29,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:29,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:29,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 363 transitions, 7068 flow [2022-12-06 05:15:29,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 363 transitions, 7068 flow [2022-12-06 05:15:29,571 INFO L130 PetriNetUnfolder]: 442/1820 cut-off events. [2022-12-06 05:15:29,571 INFO L131 PetriNetUnfolder]: For 17537/17945 co-relation queries the response was YES. [2022-12-06 05:15:29,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 1820 events. 442/1820 cut-off events. For 17537/17945 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17941 event pairs, 0 based on Foata normal form. 99/1821 useless extension candidates. Maximal degree in co-relation 9092. Up to 277 conditions per place. [2022-12-06 05:15:29,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 363 transitions, 7068 flow [2022-12-06 05:15:29,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 2692 [2022-12-06 05:15:29,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:29,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:15:29,601 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 363 transitions, 7068 flow [2022-12-06 05:15:29,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:29,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:29,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:29,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:15:29,601 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash 616095279, now seen corresponding path program 1 times [2022-12-06 05:15:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:29,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542495690] [2022-12-06 05:15:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:29,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:29,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:29,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542495690] [2022-12-06 05:15:29,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542495690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:29,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:29,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302811388] [2022-12-06 05:15:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:29,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:29,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:29,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 363 transitions, 7068 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:29,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:29,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:29,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:31,359 INFO L130 PetriNetUnfolder]: 7742/12368 cut-off events. [2022-12-06 05:15:31,360 INFO L131 PetriNetUnfolder]: For 128091/128091 co-relation queries the response was YES. [2022-12-06 05:15:31,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71294 conditions, 12368 events. 7742/12368 cut-off events. For 128091/128091 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 83168 event pairs, 1298 based on Foata normal form. 8/11882 useless extension candidates. Maximal degree in co-relation 69532. Up to 4622 conditions per place. [2022-12-06 05:15:31,437 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 289 selfloop transitions, 197 changer transitions 7/494 dead transitions. [2022-12-06 05:15:31,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 494 transitions, 9452 flow [2022-12-06 05:15:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-06 05:15:31,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43465045592705165 [2022-12-06 05:15:31,439 INFO L175 Difference]: Start difference. First operand has 166 places, 363 transitions, 7068 flow. Second operand 7 states and 143 transitions. [2022-12-06 05:15:31,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 494 transitions, 9452 flow [2022-12-06 05:15:31,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 494 transitions, 9196 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-06 05:15:31,989 INFO L231 Difference]: Finished difference. Result has 171 places, 408 transitions, 8180 flow [2022-12-06 05:15:31,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6842, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8180, PETRI_PLACES=171, PETRI_TRANSITIONS=408} [2022-12-06 05:15:31,989 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2022-12-06 05:15:31,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:31,989 INFO L89 Accepts]: Start accepts. Operand has 171 places, 408 transitions, 8180 flow [2022-12-06 05:15:31,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:31,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:31,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 408 transitions, 8180 flow [2022-12-06 05:15:31,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 408 transitions, 8180 flow [2022-12-06 05:15:32,167 INFO L130 PetriNetUnfolder]: 491/2065 cut-off events. [2022-12-06 05:15:32,167 INFO L131 PetriNetUnfolder]: For 19854/20288 co-relation queries the response was YES. [2022-12-06 05:15:32,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10548 conditions, 2065 events. 491/2065 cut-off events. For 19854/20288 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21136 event pairs, 0 based on Foata normal form. 105/2064 useless extension candidates. Maximal degree in co-relation 10216. Up to 311 conditions per place. [2022-12-06 05:15:32,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 408 transitions, 8180 flow [2022-12-06 05:15:32,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 2828 [2022-12-06 05:15:32,198 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:32,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 05:15:32,199 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 408 transitions, 8180 flow [2022-12-06 05:15:32,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:32,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:32,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:32,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:15:32,199 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 33751729, now seen corresponding path program 2 times [2022-12-06 05:15:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:32,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429422798] [2022-12-06 05:15:32,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:32,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:32,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429422798] [2022-12-06 05:15:32,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429422798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:32,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:32,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461696862] [2022-12-06 05:15:32,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:32,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:32,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:32,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:32,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:32,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 408 transitions, 8180 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:32,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:32,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:32,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:34,181 INFO L130 PetriNetUnfolder]: 8506/13631 cut-off events. [2022-12-06 05:15:34,181 INFO L131 PetriNetUnfolder]: For 140609/140609 co-relation queries the response was YES. [2022-12-06 05:15:34,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79030 conditions, 13631 events. 8506/13631 cut-off events. For 140609/140609 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 94116 event pairs, 1058 based on Foata normal form. 8/13111 useless extension candidates. Maximal degree in co-relation 76841. Up to 5970 conditions per place. [2022-12-06 05:15:34,282 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 372 selfloop transitions, 150 changer transitions 18/541 dead transitions. [2022-12-06 05:15:34,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 541 transitions, 10953 flow [2022-12-06 05:15:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-12-06 05:15:34,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:15:34,283 INFO L175 Difference]: Start difference. First operand has 171 places, 408 transitions, 8180 flow. Second operand 6 states and 141 transitions. [2022-12-06 05:15:34,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 541 transitions, 10953 flow [2022-12-06 05:15:35,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 541 transitions, 10833 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-12-06 05:15:35,381 INFO L231 Difference]: Finished difference. Result has 177 places, 423 transitions, 9009 flow [2022-12-06 05:15:35,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8088, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9009, PETRI_PLACES=177, PETRI_TRANSITIONS=423} [2022-12-06 05:15:35,381 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 139 predicate places. [2022-12-06 05:15:35,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:35,381 INFO L89 Accepts]: Start accepts. Operand has 177 places, 423 transitions, 9009 flow [2022-12-06 05:15:35,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:35,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:35,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 423 transitions, 9009 flow [2022-12-06 05:15:35,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 423 transitions, 9009 flow [2022-12-06 05:15:35,616 INFO L130 PetriNetUnfolder]: 524/2208 cut-off events. [2022-12-06 05:15:35,617 INFO L131 PetriNetUnfolder]: For 23925/24369 co-relation queries the response was YES. [2022-12-06 05:15:35,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11773 conditions, 2208 events. 524/2208 cut-off events. For 23925/24369 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22875 event pairs, 0 based on Foata normal form. 117/2213 useless extension candidates. Maximal degree in co-relation 11181. Up to 356 conditions per place. [2022-12-06 05:15:35,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 423 transitions, 9009 flow [2022-12-06 05:15:35,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 2946 [2022-12-06 05:15:35,657 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:35,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-06 05:15:35,657 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 423 transitions, 9009 flow [2022-12-06 05:15:35,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:35,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:35,658 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:35,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:15:35,658 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1773962696, now seen corresponding path program 1 times [2022-12-06 05:15:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:35,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476531338] [2022-12-06 05:15:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:35,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:35,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:35,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476531338] [2022-12-06 05:15:35,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476531338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:35,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:35,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549917692] [2022-12-06 05:15:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:35,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:35,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:35,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:35,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:35,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 423 transitions, 9009 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:35,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:35,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:35,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:37,570 INFO L130 PetriNetUnfolder]: 8120/13081 cut-off events. [2022-12-06 05:15:37,570 INFO L131 PetriNetUnfolder]: For 155037/155037 co-relation queries the response was YES. [2022-12-06 05:15:37,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76692 conditions, 13081 events. 8120/13081 cut-off events. For 155037/155037 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 90251 event pairs, 1410 based on Foata normal form. 96/12661 useless extension candidates. Maximal degree in co-relation 74857. Up to 9674 conditions per place. [2022-12-06 05:15:37,654 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 388 selfloop transitions, 60 changer transitions 0/449 dead transitions. [2022-12-06 05:15:37,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 449 transitions, 9923 flow [2022-12-06 05:15:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-06 05:15:37,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2022-12-06 05:15:37,660 INFO L175 Difference]: Start difference. First operand has 177 places, 423 transitions, 9009 flow. Second operand 4 states and 90 transitions. [2022-12-06 05:15:37,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 449 transitions, 9923 flow [2022-12-06 05:15:38,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 449 transitions, 9746 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:38,403 INFO L231 Difference]: Finished difference. Result has 176 places, 414 transitions, 8721 flow [2022-12-06 05:15:38,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8488, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8721, PETRI_PLACES=176, PETRI_TRANSITIONS=414} [2022-12-06 05:15:38,405 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2022-12-06 05:15:38,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:38,405 INFO L89 Accepts]: Start accepts. Operand has 176 places, 414 transitions, 8721 flow [2022-12-06 05:15:38,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:38,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:38,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 414 transitions, 8721 flow [2022-12-06 05:15:38,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 414 transitions, 8721 flow [2022-12-06 05:15:38,622 INFO L130 PetriNetUnfolder]: 503/2191 cut-off events. [2022-12-06 05:15:38,622 INFO L131 PetriNetUnfolder]: For 23380/23884 co-relation queries the response was YES. [2022-12-06 05:15:38,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11277 conditions, 2191 events. 503/2191 cut-off events. For 23380/23884 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22890 event pairs, 0 based on Foata normal form. 129/2208 useless extension candidates. Maximal degree in co-relation 10707. Up to 331 conditions per place. [2022-12-06 05:15:38,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 414 transitions, 8721 flow [2022-12-06 05:15:38,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 2848 [2022-12-06 05:15:38,661 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:38,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 05:15:38,661 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 414 transitions, 8721 flow [2022-12-06 05:15:38,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:38,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:38,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:38,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:15:38,662 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:38,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash -37564633, now seen corresponding path program 3 times [2022-12-06 05:15:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:38,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127100115] [2022-12-06 05:15:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:38,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:38,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127100115] [2022-12-06 05:15:38,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127100115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:38,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:38,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339163126] [2022-12-06 05:15:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:38,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:15:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:38,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:15:38,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:15:38,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:38,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 414 transitions, 8721 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:38,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:38,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:38,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:40,732 INFO L130 PetriNetUnfolder]: 8120/13021 cut-off events. [2022-12-06 05:15:40,732 INFO L131 PetriNetUnfolder]: For 147555/147555 co-relation queries the response was YES. [2022-12-06 05:15:40,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76350 conditions, 13021 events. 8120/13021 cut-off events. For 147555/147555 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 89051 event pairs, 1632 based on Foata normal form. 4/12500 useless extension candidates. Maximal degree in co-relation 74069. Up to 7067 conditions per place. [2022-12-06 05:15:40,829 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 321 selfloop transitions, 141 changer transitions 9/472 dead transitions. [2022-12-06 05:15:40,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 472 transitions, 9935 flow [2022-12-06 05:15:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-06 05:15:40,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-06 05:15:40,830 INFO L175 Difference]: Start difference. First operand has 176 places, 414 transitions, 8721 flow. Second operand 6 states and 126 transitions. [2022-12-06 05:15:40,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 472 transitions, 9935 flow [2022-12-06 05:15:41,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 472 transitions, 9889 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:15:41,476 INFO L231 Difference]: Finished difference. Result has 181 places, 406 transitions, 8815 flow [2022-12-06 05:15:41,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8675, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8815, PETRI_PLACES=181, PETRI_TRANSITIONS=406} [2022-12-06 05:15:41,477 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2022-12-06 05:15:41,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:41,477 INFO L89 Accepts]: Start accepts. Operand has 181 places, 406 transitions, 8815 flow [2022-12-06 05:15:41,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:41,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:41,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 406 transitions, 8815 flow [2022-12-06 05:15:41,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 406 transitions, 8815 flow [2022-12-06 05:15:41,756 INFO L130 PetriNetUnfolder]: 498/2138 cut-off events. [2022-12-06 05:15:41,756 INFO L131 PetriNetUnfolder]: For 24197/24695 co-relation queries the response was YES. [2022-12-06 05:15:41,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 2138 events. 498/2138 cut-off events. For 24197/24695 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22106 event pairs, 0 based on Foata normal form. 125/2156 useless extension candidates. Maximal degree in co-relation 10887. Up to 331 conditions per place. [2022-12-06 05:15:41,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 406 transitions, 8815 flow [2022-12-06 05:15:41,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 2832 [2022-12-06 05:15:41,788 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:41,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-06 05:15:41,789 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 406 transitions, 8815 flow [2022-12-06 05:15:41,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:41,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:41,789 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:41,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:15:41,789 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -964678587, now seen corresponding path program 4 times [2022-12-06 05:15:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:41,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612505544] [2022-12-06 05:15:41,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612505544] [2022-12-06 05:15:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612505544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:41,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:41,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:41,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983100839] [2022-12-06 05:15:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:41,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:41,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:41,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 406 transitions, 8815 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:41,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:41,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:41,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:43,881 INFO L130 PetriNetUnfolder]: 8086/12908 cut-off events. [2022-12-06 05:15:43,881 INFO L131 PetriNetUnfolder]: For 160116/160116 co-relation queries the response was YES. [2022-12-06 05:15:43,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77628 conditions, 12908 events. 8086/12908 cut-off events. For 160116/160116 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 87713 event pairs, 3254 based on Foata normal form. 4/12396 useless extension candidates. Maximal degree in co-relation 75696. Up to 9588 conditions per place. [2022-12-06 05:15:43,968 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 396 selfloop transitions, 58 changer transitions 7/462 dead transitions. [2022-12-06 05:15:43,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 462 transitions, 10123 flow [2022-12-06 05:15:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-06 05:15:43,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4425531914893617 [2022-12-06 05:15:43,969 INFO L175 Difference]: Start difference. First operand has 181 places, 406 transitions, 8815 flow. Second operand 5 states and 104 transitions. [2022-12-06 05:15:43,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 462 transitions, 10123 flow [2022-12-06 05:15:44,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 462 transitions, 9844 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:15:44,562 INFO L231 Difference]: Finished difference. Result has 182 places, 404 transitions, 8613 flow [2022-12-06 05:15:44,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8540, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8613, PETRI_PLACES=182, PETRI_TRANSITIONS=404} [2022-12-06 05:15:44,562 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 144 predicate places. [2022-12-06 05:15:44,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:44,562 INFO L89 Accepts]: Start accepts. Operand has 182 places, 404 transitions, 8613 flow [2022-12-06 05:15:44,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:44,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:44,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 404 transitions, 8613 flow [2022-12-06 05:15:44,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 404 transitions, 8613 flow [2022-12-06 05:15:44,754 INFO L130 PetriNetUnfolder]: 493/2101 cut-off events. [2022-12-06 05:15:44,754 INFO L131 PetriNetUnfolder]: For 23172/23809 co-relation queries the response was YES. [2022-12-06 05:15:44,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11157 conditions, 2101 events. 493/2101 cut-off events. For 23172/23809 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21597 event pairs, 0 based on Foata normal form. 113/2107 useless extension candidates. Maximal degree in co-relation 10578. Up to 322 conditions per place. [2022-12-06 05:15:44,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 404 transitions, 8613 flow [2022-12-06 05:15:44,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 2812 [2022-12-06 05:15:44,789 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:44,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 05:15:44,790 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 404 transitions, 8613 flow [2022-12-06 05:15:44,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:44,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:44,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:44,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:15:44,790 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash 985819455, now seen corresponding path program 1 times [2022-12-06 05:15:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:44,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120030407] [2022-12-06 05:15:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:44,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:44,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120030407] [2022-12-06 05:15:44,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120030407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:44,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:44,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649973972] [2022-12-06 05:15:44,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:44,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:44,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:44,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:44,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:44,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:44,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 404 transitions, 8613 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:44,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:44,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:44,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:46,796 INFO L130 PetriNetUnfolder]: 7698/12249 cut-off events. [2022-12-06 05:15:46,796 INFO L131 PetriNetUnfolder]: For 141289/141289 co-relation queries the response was YES. [2022-12-06 05:15:46,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71795 conditions, 12249 events. 7698/12249 cut-off events. For 141289/141289 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 82092 event pairs, 1456 based on Foata normal form. 96/11869 useless extension candidates. Maximal degree in co-relation 69857. Up to 9700 conditions per place. [2022-12-06 05:15:46,868 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 372 selfloop transitions, 50 changer transitions 0/423 dead transitions. [2022-12-06 05:15:46,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 423 transitions, 9314 flow [2022-12-06 05:15:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 05:15:46,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2022-12-06 05:15:46,870 INFO L175 Difference]: Start difference. First operand has 182 places, 404 transitions, 8613 flow. Second operand 4 states and 92 transitions. [2022-12-06 05:15:46,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 423 transitions, 9314 flow [2022-12-06 05:15:47,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 423 transitions, 9119 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-06 05:15:47,384 INFO L231 Difference]: Finished difference. Result has 179 places, 393 transitions, 8191 flow [2022-12-06 05:15:47,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8027, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8191, PETRI_PLACES=179, PETRI_TRANSITIONS=393} [2022-12-06 05:15:47,386 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2022-12-06 05:15:47,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:47,387 INFO L89 Accepts]: Start accepts. Operand has 179 places, 393 transitions, 8191 flow [2022-12-06 05:15:47,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:47,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:47,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 393 transitions, 8191 flow [2022-12-06 05:15:47,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 393 transitions, 8191 flow [2022-12-06 05:15:47,626 INFO L130 PetriNetUnfolder]: 486/1962 cut-off events. [2022-12-06 05:15:47,626 INFO L131 PetriNetUnfolder]: For 20574/21106 co-relation queries the response was YES. [2022-12-06 05:15:47,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 1962 events. 486/1962 cut-off events. For 20574/21106 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19498 event pairs, 0 based on Foata normal form. 91/1950 useless extension candidates. Maximal degree in co-relation 9922. Up to 297 conditions per place. [2022-12-06 05:15:47,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 393 transitions, 8191 flow [2022-12-06 05:15:47,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 2706 [2022-12-06 05:15:47,655 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:47,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 05:15:47,656 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 393 transitions, 8191 flow [2022-12-06 05:15:47,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:47,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:47,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:47,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:15:47,657 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1236107118, now seen corresponding path program 2 times [2022-12-06 05:15:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:47,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732576544] [2022-12-06 05:15:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:47,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:47,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732576544] [2022-12-06 05:15:47,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732576544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:47,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:47,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575027396] [2022-12-06 05:15:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:47,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:47,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:47,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:15:47,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 393 transitions, 8191 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:47,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:47,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:15:47,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:49,169 INFO L130 PetriNetUnfolder]: 7138/11221 cut-off events. [2022-12-06 05:15:49,169 INFO L131 PetriNetUnfolder]: For 123918/123918 co-relation queries the response was YES. [2022-12-06 05:15:49,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67534 conditions, 11221 events. 7138/11221 cut-off events. For 123918/123918 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 72343 event pairs, 1156 based on Foata normal form. 56/10869 useless extension candidates. Maximal degree in co-relation 65839. Up to 6712 conditions per place. [2022-12-06 05:15:49,241 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 371 selfloop transitions, 42 changer transitions 14/428 dead transitions. [2022-12-06 05:15:49,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 428 transitions, 8934 flow [2022-12-06 05:15:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-06 05:15:49,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.451063829787234 [2022-12-06 05:15:49,242 INFO L175 Difference]: Start difference. First operand has 179 places, 393 transitions, 8191 flow. Second operand 5 states and 106 transitions. [2022-12-06 05:15:49,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 428 transitions, 8934 flow [2022-12-06 05:15:49,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 428 transitions, 8770 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-12-06 05:15:49,744 INFO L231 Difference]: Finished difference. Result has 179 places, 361 transitions, 7366 flow [2022-12-06 05:15:49,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7553, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7366, PETRI_PLACES=179, PETRI_TRANSITIONS=361} [2022-12-06 05:15:49,745 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2022-12-06 05:15:49,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:49,745 INFO L89 Accepts]: Start accepts. Operand has 179 places, 361 transitions, 7366 flow [2022-12-06 05:15:49,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:49,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:49,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 361 transitions, 7366 flow [2022-12-06 05:15:49,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 361 transitions, 7366 flow [2022-12-06 05:15:49,889 INFO L130 PetriNetUnfolder]: 440/1678 cut-off events. [2022-12-06 05:15:49,889 INFO L131 PetriNetUnfolder]: For 17154/17424 co-relation queries the response was YES. [2022-12-06 05:15:49,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9226 conditions, 1678 events. 440/1678 cut-off events. For 17154/17424 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15791 event pairs, 0 based on Foata normal form. 91/1684 useless extension candidates. Maximal degree in co-relation 8989. Up to 259 conditions per place. [2022-12-06 05:15:49,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 361 transitions, 7366 flow [2022-12-06 05:15:49,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 2566 [2022-12-06 05:15:49,914 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:49,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:15:49,915 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 361 transitions, 7366 flow [2022-12-06 05:15:49,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:49,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:49,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:49,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:15:49,915 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 354104493, now seen corresponding path program 5 times [2022-12-06 05:15:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834153942] [2022-12-06 05:15:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:50,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834153942] [2022-12-06 05:15:50,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834153942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:50,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:50,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818688054] [2022-12-06 05:15:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:50,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 05:15:50,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 361 transitions, 7366 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:50,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:50,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 05:15:50,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:51,452 INFO L130 PetriNetUnfolder]: 7066/11052 cut-off events. [2022-12-06 05:15:51,452 INFO L131 PetriNetUnfolder]: For 118464/118464 co-relation queries the response was YES. [2022-12-06 05:15:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66432 conditions, 11052 events. 7066/11052 cut-off events. For 118464/118464 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 70477 event pairs, 1224 based on Foata normal form. 4/10627 useless extension candidates. Maximal degree in co-relation 65902. Up to 3419 conditions per place. [2022-12-06 05:15:51,526 INFO L137 encePairwiseOnDemand]: 30/46 looper letters, 266 selfloop transitions, 138 changer transitions 13/418 dead transitions. [2022-12-06 05:15:51,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 418 transitions, 8392 flow [2022-12-06 05:15:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-12-06 05:15:51,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 05:15:51,527 INFO L175 Difference]: Start difference. First operand has 179 places, 361 transitions, 7366 flow. Second operand 6 states and 129 transitions. [2022-12-06 05:15:51,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 418 transitions, 8392 flow [2022-12-06 05:15:51,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 418 transitions, 8294 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:51,977 INFO L231 Difference]: Finished difference. Result has 183 places, 357 transitions, 7556 flow [2022-12-06 05:15:51,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7268, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7556, PETRI_PLACES=183, PETRI_TRANSITIONS=357} [2022-12-06 05:15:51,978 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2022-12-06 05:15:51,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:51,978 INFO L89 Accepts]: Start accepts. Operand has 183 places, 357 transitions, 7556 flow [2022-12-06 05:15:51,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:51,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:51,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 357 transitions, 7556 flow [2022-12-06 05:15:51,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 357 transitions, 7556 flow [2022-12-06 05:15:52,128 INFO L130 PetriNetUnfolder]: 439/1625 cut-off events. [2022-12-06 05:15:52,128 INFO L131 PetriNetUnfolder]: For 17886/18163 co-relation queries the response was YES. [2022-12-06 05:15:52,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9691 conditions, 1625 events. 439/1625 cut-off events. For 17886/18163 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14988 event pairs, 0 based on Foata normal form. 92/1636 useless extension candidates. Maximal degree in co-relation 9575. Up to 255 conditions per place. [2022-12-06 05:15:52,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 357 transitions, 7556 flow [2022-12-06 05:15:52,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 2566 [2022-12-06 05:15:52,155 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:52,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:15:52,155 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 357 transitions, 7556 flow [2022-12-06 05:15:52,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:52,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:52,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:52,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:15:52,156 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash 700599877, now seen corresponding path program 6 times [2022-12-06 05:15:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:52,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284362999] [2022-12-06 05:15:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:52,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284362999] [2022-12-06 05:15:52,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284362999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:52,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:52,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117837625] [2022-12-06 05:15:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:52,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:52,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 05:15:52,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 357 transitions, 7556 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:52,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:52,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 05:15:52,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:53,722 INFO L130 PetriNetUnfolder]: 7032/10965 cut-off events. [2022-12-06 05:15:53,722 INFO L131 PetriNetUnfolder]: For 128425/128425 co-relation queries the response was YES. [2022-12-06 05:15:53,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70267 conditions, 10965 events. 7032/10965 cut-off events. For 128425/128425 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 70066 event pairs, 1134 based on Foata normal form. 8/10561 useless extension candidates. Maximal degree in co-relation 70077. Up to 3230 conditions per place. [2022-12-06 05:15:53,802 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 304 selfloop transitions, 116 changer transitions 20/441 dead transitions. [2022-12-06 05:15:53,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 441 transitions, 9024 flow [2022-12-06 05:15:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-06 05:15:53,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2022-12-06 05:15:53,807 INFO L175 Difference]: Start difference. First operand has 182 places, 357 transitions, 7556 flow. Second operand 6 states and 133 transitions. [2022-12-06 05:15:53,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 441 transitions, 9024 flow [2022-12-06 05:15:54,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 441 transitions, 8718 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:54,216 INFO L231 Difference]: Finished difference. Result has 183 places, 347 transitions, 7294 flow [2022-12-06 05:15:54,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7261, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7294, PETRI_PLACES=183, PETRI_TRANSITIONS=347} [2022-12-06 05:15:54,216 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2022-12-06 05:15:54,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:54,217 INFO L89 Accepts]: Start accepts. Operand has 183 places, 347 transitions, 7294 flow [2022-12-06 05:15:54,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:54,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:54,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 347 transitions, 7294 flow [2022-12-06 05:15:54,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 347 transitions, 7294 flow [2022-12-06 05:15:54,353 INFO L130 PetriNetUnfolder]: 441/1559 cut-off events. [2022-12-06 05:15:54,353 INFO L131 PetriNetUnfolder]: For 17054/17530 co-relation queries the response was YES. [2022-12-06 05:15:54,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 1559 events. 441/1559 cut-off events. For 17054/17530 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13961 event pairs, 0 based on Foata normal form. 92/1569 useless extension candidates. Maximal degree in co-relation 9222. Up to 246 conditions per place. [2022-12-06 05:15:54,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 347 transitions, 7294 flow [2022-12-06 05:15:54,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 2510 [2022-12-06 05:15:54,379 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:54,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 05:15:54,379 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 347 transitions, 7294 flow [2022-12-06 05:15:54,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:54,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:54,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:54,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:15:54,380 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1368851828, now seen corresponding path program 1 times [2022-12-06 05:15:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:54,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514606804] [2022-12-06 05:15:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:54,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:54,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514606804] [2022-12-06 05:15:54,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514606804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:54,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:54,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474534422] [2022-12-06 05:15:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:54,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:54,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 05:15:54,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 347 transitions, 7294 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:54,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:54,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 05:15:54,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:55,680 INFO L130 PetriNetUnfolder]: 6606/10303 cut-off events. [2022-12-06 05:15:55,680 INFO L131 PetriNetUnfolder]: For 125612/125612 co-relation queries the response was YES. [2022-12-06 05:15:55,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65104 conditions, 10303 events. 6606/10303 cut-off events. For 125612/125612 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 64636 event pairs, 2374 based on Foata normal form. 104/10002 useless extension candidates. Maximal degree in co-relation 64905. Up to 6840 conditions per place. [2022-12-06 05:15:55,754 INFO L137 encePairwiseOnDemand]: 41/46 looper letters, 357 selfloop transitions, 31 changer transitions 14/403 dead transitions. [2022-12-06 05:15:55,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 403 transitions, 8265 flow [2022-12-06 05:15:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-12-06 05:15:55,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2022-12-06 05:15:55,756 INFO L175 Difference]: Start difference. First operand has 179 places, 347 transitions, 7294 flow. Second operand 5 states and 114 transitions. [2022-12-06 05:15:55,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 403 transitions, 8265 flow [2022-12-06 05:15:56,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 403 transitions, 8081 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-06 05:15:56,248 INFO L231 Difference]: Finished difference. Result has 176 places, 329 transitions, 6793 flow [2022-12-06 05:15:56,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6891, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6793, PETRI_PLACES=176, PETRI_TRANSITIONS=329} [2022-12-06 05:15:56,248 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2022-12-06 05:15:56,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:56,249 INFO L89 Accepts]: Start accepts. Operand has 176 places, 329 transitions, 6793 flow [2022-12-06 05:15:56,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:56,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:56,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 329 transitions, 6793 flow [2022-12-06 05:15:56,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 329 transitions, 6793 flow [2022-12-06 05:15:56,370 INFO L130 PetriNetUnfolder]: 399/1452 cut-off events. [2022-12-06 05:15:56,370 INFO L131 PetriNetUnfolder]: For 14440/14641 co-relation queries the response was YES. [2022-12-06 05:15:56,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8410 conditions, 1452 events. 399/1452 cut-off events. For 14440/14641 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12890 event pairs, 0 based on Foata normal form. 81/1461 useless extension candidates. Maximal degree in co-relation 7893. Up to 240 conditions per place. [2022-12-06 05:15:56,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 329 transitions, 6793 flow [2022-12-06 05:15:56,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 2394 [2022-12-06 05:15:56,392 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:56,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 05:15:56,393 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 329 transitions, 6793 flow [2022-12-06 05:15:56,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:56,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:56,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:56,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:15:56,393 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 403006098, now seen corresponding path program 2 times [2022-12-06 05:15:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:56,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780692368] [2022-12-06 05:15:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:56,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:56,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780692368] [2022-12-06 05:15:56,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780692368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:56,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:56,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98379522] [2022-12-06 05:15:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:56,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:56,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:56,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 05:15:56,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 329 transitions, 6793 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:56,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:56,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 05:15:56,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:57,742 INFO L130 PetriNetUnfolder]: 5924/9005 cut-off events. [2022-12-06 05:15:57,742 INFO L131 PetriNetUnfolder]: For 104945/104945 co-relation queries the response was YES. [2022-12-06 05:15:57,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58006 conditions, 9005 events. 5924/9005 cut-off events. For 104945/104945 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 52826 event pairs, 2208 based on Foata normal form. 48/8672 useless extension candidates. Maximal degree in co-relation 57763. Up to 6728 conditions per place. [2022-12-06 05:15:57,805 INFO L137 encePairwiseOnDemand]: 41/46 looper letters, 304 selfloop transitions, 22 changer transitions 10/337 dead transitions. [2022-12-06 05:15:57,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 337 transitions, 6936 flow [2022-12-06 05:15:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 05:15:57,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4434782608695652 [2022-12-06 05:15:57,806 INFO L175 Difference]: Start difference. First operand has 176 places, 329 transitions, 6793 flow. Second operand 5 states and 102 transitions. [2022-12-06 05:15:57,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 337 transitions, 6936 flow [2022-12-06 05:15:57,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 337 transitions, 6744 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-06 05:15:57,995 INFO L231 Difference]: Finished difference. Result has 165 places, 291 transitions, 5827 flow [2022-12-06 05:15:57,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5986, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5827, PETRI_PLACES=165, PETRI_TRANSITIONS=291} [2022-12-06 05:15:57,995 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2022-12-06 05:15:57,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:57,996 INFO L89 Accepts]: Start accepts. Operand has 165 places, 291 transitions, 5827 flow [2022-12-06 05:15:57,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:57,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:57,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 291 transitions, 5827 flow [2022-12-06 05:15:57,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 291 transitions, 5827 flow [2022-12-06 05:15:58,094 INFO L130 PetriNetUnfolder]: 358/1183 cut-off events. [2022-12-06 05:15:58,095 INFO L131 PetriNetUnfolder]: For 12204/12354 co-relation queries the response was YES. [2022-12-06 05:15:58,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 1183 events. 358/1183 cut-off events. For 12204/12354 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9584 event pairs, 0 based on Foata normal form. 64/1195 useless extension candidates. Maximal degree in co-relation 6338. Up to 232 conditions per place. [2022-12-06 05:15:58,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 291 transitions, 5827 flow [2022-12-06 05:15:58,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 2168 [2022-12-06 05:15:58,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:58,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:58,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1054] L69-6-->thread2EXIT: Formula: (and (or (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n3~0_88)) (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n2~0_84))) (let ((.cse2 (= (mod v_thread2Thread1of1ForFork1_~stop~1_33 256) 0)) (.cse0 (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) (or (and .cse0 (= (+ v_~n3~0_88 v_~res2~0_56) v_~n2~0_84) .cse1 .cse2) (and (not .cse2) (= v_~res2~0_57 v_~res2~0_56) .cse0 .cse1)))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, ~res2~0=v_~res2~0_57} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, ~n2~0=v_~n2~0_84, ~n3~0=v_~n3~0_88, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_33, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~res2~0=v_~res2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:58,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:59,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:59,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1027 [2022-12-06 05:15:59,024 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 290 transitions, 5882 flow [2022-12-06 05:15:59,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:59,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:59,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:59,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:15:59,024 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -277698036, now seen corresponding path program 3 times [2022-12-06 05:15:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:59,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899967980] [2022-12-06 05:15:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:59,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:59,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899967980] [2022-12-06 05:15:59,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899967980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:59,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:59,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555067158] [2022-12-06 05:15:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:59,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:59,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 05:15:59,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 290 transitions, 5882 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:59,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:59,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 05:15:59,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:00,022 INFO L130 PetriNetUnfolder]: 5244/7929 cut-off events. [2022-12-06 05:16:00,022 INFO L131 PetriNetUnfolder]: For 93731/93731 co-relation queries the response was YES. [2022-12-06 05:16:00,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49278 conditions, 7929 events. 5244/7929 cut-off events. For 93731/93731 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 45371 event pairs, 1012 based on Foata normal form. 152/7721 useless extension candidates. Maximal degree in co-relation 45255. Up to 5612 conditions per place. [2022-12-06 05:16:00,072 INFO L137 encePairwiseOnDemand]: 44/50 looper letters, 250 selfloop transitions, 28 changer transitions 23/302 dead transitions. [2022-12-06 05:16:00,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 302 transitions, 6237 flow [2022-12-06 05:16:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 05:16:00,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-06 05:16:00,073 INFO L175 Difference]: Start difference. First operand has 163 places, 290 transitions, 5882 flow. Second operand 5 states and 85 transitions. [2022-12-06 05:16:00,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 302 transitions, 6237 flow [2022-12-06 05:16:00,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 302 transitions, 6053 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-06 05:16:00,231 INFO L231 Difference]: Finished difference. Result has 159 places, 258 transitions, 4994 flow [2022-12-06 05:16:00,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5325, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4994, PETRI_PLACES=159, PETRI_TRANSITIONS=258} [2022-12-06 05:16:00,232 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 121 predicate places. [2022-12-06 05:16:00,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:00,232 INFO L89 Accepts]: Start accepts. Operand has 159 places, 258 transitions, 4994 flow [2022-12-06 05:16:00,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:00,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:00,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 258 transitions, 4994 flow [2022-12-06 05:16:00,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 258 transitions, 4994 flow [2022-12-06 05:16:00,308 INFO L130 PetriNetUnfolder]: 317/966 cut-off events. [2022-12-06 05:16:00,308 INFO L131 PetriNetUnfolder]: For 10043/10170 co-relation queries the response was YES. [2022-12-06 05:16:00,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5807 conditions, 966 events. 317/966 cut-off events. For 10043/10170 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7056 event pairs, 0 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 5556. Up to 202 conditions per place. [2022-12-06 05:16:00,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 258 transitions, 4994 flow [2022-12-06 05:16:00,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 1838 [2022-12-06 05:16:00,326 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:16:00,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:16:00,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:16:00,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] L89-6-->thread3EXIT: Formula: (and (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse1 (= 0 (mod v_thread3Thread1of1ForFork2_~stop~2_35 256))) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 (not .cse1) (= v_~res3~0_39 v_~res3~0_38) .cse2) (and .cse0 (= v_~n1~0_90 (+ v_~n3~0_82 v_~res3~0_38)) .cse1 .cse2))) (let ((.cse3 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n3~0_82)) (.cse4 (< v_thread3Thread1of1ForFork2_~i~2_51 v_~n1~0_90))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_36 v_thread3Thread1of1ForFork2_~stop~2_35) (= |v_thread3Thread1of1ForFork2_#t~mem14_29| |v_thread3Thread1of1ForFork2_#t~mem14_30|) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_26| |v_thread3Thread1of1ForFork2_#t~mem15_25|) (= |v_thread3Thread1of1ForFork2_#t~mem13_46| |v_thread3Thread1of1ForFork2_#t~mem13_45|) (or (not .cse3) (not .cse4)) (= v_~res3~0_39 v_~res3~0_40)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_51 4))) (let ((.cse6 (select (select |v_#memory_int_262| v_~get1~0.base_69) (+ v_~get1~0.offset_69 .cse7))) (.cse5 (select (select |v_#memory_int_262| v_~get3~0.base_69) (+ v_~get3~0.offset_69 .cse7)))) (and (= v_thread3Thread1of1ForFork2_~stop~2_35 1) .cse3 .cse4 (not (= .cse5 .cse6)) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res3~0_39))))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_46|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_26|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_30|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_36, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_40} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_45|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~get3~0.base=v_~get3~0.base_69, ~n3~0=v_~n3~0_82, ~n1~0=v_~n1~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_69, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_25|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_51, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_29|, ~get1~0.base=v_~get1~0.base_69, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_35, #memory_int=|v_#memory_int_262|, ~get1~0.offset=v_~get1~0.offset_69, ~res3~0=v_~res3~0_38} AuxVars[v_~res3~0_39] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1052] L49-6-->thread1EXIT: Formula: (and (let ((.cse1 (= |v_thread1Thread1of1ForFork0_#res.offset_17| 0)) (.cse2 (= |v_thread1Thread1of1ForFork0_#res.base_17| 0)) (.cse0 (= 0 (mod v_thread1Thread1of1ForFork0_~stop~0_41 256)))) (or (and (= (+ v_~n2~0_80 v_~res1~0_58) v_~n1~0_94) .cse0 .cse1 .cse2) (and .cse1 (= v_~res1~0_59 v_~res1~0_58) .cse2 (not .cse0)))) (or (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n2~0_80)) (not (< v_thread1Thread1of1ForFork0_~i~0_81 v_~n1~0_94)))) InVars {~res1~0=v_~res1~0_59, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} OutVars{~res1~0=v_~res1~0_58, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_17|, ~n2~0=v_~n2~0_80, ~n1~0=v_~n1~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_81, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_17|, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_41} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-06 05:16:01,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:01,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 883 [2022-12-06 05:16:01,115 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 257 transitions, 5055 flow [2022-12-06 05:16:01,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:01,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:01,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:01,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:16:01,115 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1595816312, now seen corresponding path program 1 times [2022-12-06 05:16:01,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:01,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546580557] [2022-12-06 05:16:01,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:01,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:01,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546580557] [2022-12-06 05:16:01,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546580557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:01,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:01,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284064049] [2022-12-06 05:16:01,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:01,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:01,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 05:16:01,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 257 transitions, 5055 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:01,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:01,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 05:16:01,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:01,990 INFO L130 PetriNetUnfolder]: 4692/7113 cut-off events. [2022-12-06 05:16:01,991 INFO L131 PetriNetUnfolder]: For 77730/77730 co-relation queries the response was YES. [2022-12-06 05:16:02,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41670 conditions, 7113 events. 4692/7113 cut-off events. For 77730/77730 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 39879 event pairs, 460 based on Foata normal form. 200/6993 useless extension candidates. Maximal degree in co-relation 40497. Up to 4466 conditions per place. [2022-12-06 05:16:02,034 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 265 selfloop transitions, 34 changer transitions 0/300 dead transitions. [2022-12-06 05:16:02,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 300 transitions, 5937 flow [2022-12-06 05:16:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 05:16:02,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45408163265306123 [2022-12-06 05:16:02,035 INFO L175 Difference]: Start difference. First operand has 150 places, 257 transitions, 5055 flow. Second operand 4 states and 89 transitions. [2022-12-06 05:16:02,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 300 transitions, 5937 flow [2022-12-06 05:16:02,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 300 transitions, 5686 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-12-06 05:16:02,099 INFO L231 Difference]: Finished difference. Result has 144 places, 252 transitions, 4768 flow [2022-12-06 05:16:02,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4700, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4768, PETRI_PLACES=144, PETRI_TRANSITIONS=252} [2022-12-06 05:16:02,100 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 106 predicate places. [2022-12-06 05:16:02,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:02,100 INFO L89 Accepts]: Start accepts. Operand has 144 places, 252 transitions, 4768 flow [2022-12-06 05:16:02,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:02,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:02,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 252 transitions, 4768 flow [2022-12-06 05:16:02,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 252 transitions, 4768 flow [2022-12-06 05:16:02,172 INFO L130 PetriNetUnfolder]: 299/954 cut-off events. [2022-12-06 05:16:02,172 INFO L131 PetriNetUnfolder]: For 8331/8411 co-relation queries the response was YES. [2022-12-06 05:16:02,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 954 events. 299/954 cut-off events. For 8331/8411 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7129 event pairs, 0 based on Foata normal form. 46/950 useless extension candidates. Maximal degree in co-relation 4401. Up to 203 conditions per place. [2022-12-06 05:16:02,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 252 transitions, 4768 flow [2022-12-06 05:16:02,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-06 05:16:02,186 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:02,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 05:16:02,186 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 252 transitions, 4768 flow [2022-12-06 05:16:02,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:02,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:02,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:02,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 05:16:02,187 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 260300290, now seen corresponding path program 1 times [2022-12-06 05:16:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:02,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228583409] [2022-12-06 05:16:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:02,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228583409] [2022-12-06 05:16:02,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228583409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:02,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:02,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653423799] [2022-12-06 05:16:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:02,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:02,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 05:16:02,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 252 transitions, 4768 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:02,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:02,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 05:16:02,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:02,931 INFO L130 PetriNetUnfolder]: 4176/6269 cut-off events. [2022-12-06 05:16:02,931 INFO L131 PetriNetUnfolder]: For 60729/60729 co-relation queries the response was YES. [2022-12-06 05:16:02,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36676 conditions, 6269 events. 4176/6269 cut-off events. For 60729/60729 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 33561 event pairs, 1670 based on Foata normal form. 104/6058 useless extension candidates. Maximal degree in co-relation 29523. Up to 5166 conditions per place. [2022-12-06 05:16:02,961 INFO L137 encePairwiseOnDemand]: 44/49 looper letters, 226 selfloop transitions, 5 changer transitions 33/265 dead transitions. [2022-12-06 05:16:02,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 265 transitions, 5021 flow [2022-12-06 05:16:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 05:16:02,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3551020408163265 [2022-12-06 05:16:02,962 INFO L175 Difference]: Start difference. First operand has 144 places, 252 transitions, 4768 flow. Second operand 5 states and 87 transitions. [2022-12-06 05:16:02,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 265 transitions, 5021 flow [2022-12-06 05:16:03,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 265 transitions, 4888 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:03,004 INFO L231 Difference]: Finished difference. Result has 141 places, 218 transitions, 3950 flow [2022-12-06 05:16:03,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3950, PETRI_PLACES=141, PETRI_TRANSITIONS=218} [2022-12-06 05:16:03,005 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2022-12-06 05:16:03,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:03,005 INFO L89 Accepts]: Start accepts. Operand has 141 places, 218 transitions, 3950 flow [2022-12-06 05:16:03,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:03,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:03,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 218 transitions, 3950 flow [2022-12-06 05:16:03,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 218 transitions, 3950 flow [2022-12-06 05:16:03,061 INFO L130 PetriNetUnfolder]: 258/731 cut-off events. [2022-12-06 05:16:03,061 INFO L131 PetriNetUnfolder]: For 6684/6741 co-relation queries the response was YES. [2022-12-06 05:16:03,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4351 conditions, 731 events. 258/731 cut-off events. For 6684/6741 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4723 event pairs, 0 based on Foata normal form. 29/722 useless extension candidates. Maximal degree in co-relation 3939. Up to 159 conditions per place. [2022-12-06 05:16:03,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 218 transitions, 3950 flow [2022-12-06 05:16:03,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 1594 [2022-12-06 05:16:03,071 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:03,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 05:16:03,072 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 218 transitions, 3950 flow [2022-12-06 05:16:03,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:03,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:03,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 05:16:03,072 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1389266355, now seen corresponding path program 1 times [2022-12-06 05:16:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:03,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109620327] [2022-12-06 05:16:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:03,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109620327] [2022-12-06 05:16:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109620327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:03,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:03,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396391842] [2022-12-06 05:16:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:03,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:03,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:16:03,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 218 transitions, 3950 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:03,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:03,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:16:03,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:04,016 INFO L130 PetriNetUnfolder]: 5316/7865 cut-off events. [2022-12-06 05:16:04,016 INFO L131 PetriNetUnfolder]: For 67140/67140 co-relation queries the response was YES. [2022-12-06 05:16:04,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45982 conditions, 7865 events. 5316/7865 cut-off events. For 67140/67140 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 42637 event pairs, 1306 based on Foata normal form. 4/7530 useless extension candidates. Maximal degree in co-relation 39511. Up to 3035 conditions per place. [2022-12-06 05:16:04,067 INFO L137 encePairwiseOnDemand]: 31/44 looper letters, 284 selfloop transitions, 87 changer transitions 41/413 dead transitions. [2022-12-06 05:16:04,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 413 transitions, 7499 flow [2022-12-06 05:16:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:16:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:16:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-12-06 05:16:04,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 05:16:04,068 INFO L175 Difference]: Start difference. First operand has 133 places, 218 transitions, 3950 flow. Second operand 7 states and 140 transitions. [2022-12-06 05:16:04,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 413 transitions, 7499 flow [2022-12-06 05:16:04,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 413 transitions, 7114 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-06 05:16:04,141 INFO L231 Difference]: Finished difference. Result has 135 places, 242 transitions, 4379 flow [2022-12-06 05:16:04,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3709, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4379, PETRI_PLACES=135, PETRI_TRANSITIONS=242} [2022-12-06 05:16:04,142 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 97 predicate places. [2022-12-06 05:16:04,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:04,142 INFO L89 Accepts]: Start accepts. Operand has 135 places, 242 transitions, 4379 flow [2022-12-06 05:16:04,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:04,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:04,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 242 transitions, 4379 flow [2022-12-06 05:16:04,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 242 transitions, 4379 flow [2022-12-06 05:16:04,252 INFO L130 PetriNetUnfolder]: 325/916 cut-off events. [2022-12-06 05:16:04,252 INFO L131 PetriNetUnfolder]: For 8436/8497 co-relation queries the response was YES. [2022-12-06 05:16:04,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 916 events. 325/916 cut-off events. For 8436/8497 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6344 event pairs, 0 based on Foata normal form. 39/909 useless extension candidates. Maximal degree in co-relation 4420. Up to 184 conditions per place. [2022-12-06 05:16:04,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 242 transitions, 4379 flow [2022-12-06 05:16:04,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 1770 [2022-12-06 05:16:04,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:04,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 799 [2022-12-06 05:16:04,941 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 241 transitions, 4376 flow [2022-12-06 05:16:04,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:04,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:04,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:04,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 05:16:04,942 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash 904823545, now seen corresponding path program 1 times [2022-12-06 05:16:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:04,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009108918] [2022-12-06 05:16:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:05,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:05,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009108918] [2022-12-06 05:16:05,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009108918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:05,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:05,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119130160] [2022-12-06 05:16:05,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:05,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:05,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:16:05,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 241 transitions, 4376 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:05,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:05,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:16:05,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:05,910 INFO L130 PetriNetUnfolder]: 5994/8810 cut-off events. [2022-12-06 05:16:05,910 INFO L131 PetriNetUnfolder]: For 76872/76872 co-relation queries the response was YES. [2022-12-06 05:16:05,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50598 conditions, 8810 events. 5994/8810 cut-off events. For 76872/76872 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 48299 event pairs, 2539 based on Foata normal form. 72/8483 useless extension candidates. Maximal degree in co-relation 42691. Up to 4304 conditions per place. [2022-12-06 05:16:05,969 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 469 selfloop transitions, 13 changer transitions 0/483 dead transitions. [2022-12-06 05:16:05,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 483 transitions, 8833 flow [2022-12-06 05:16:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2022-12-06 05:16:05,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6577777777777778 [2022-12-06 05:16:05,970 INFO L175 Difference]: Start difference. First operand has 134 places, 241 transitions, 4376 flow. Second operand 5 states and 148 transitions. [2022-12-06 05:16:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 483 transitions, 8833 flow [2022-12-06 05:16:06,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 483 transitions, 8631 flow, removed 39 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:06,044 INFO L231 Difference]: Finished difference. Result has 137 places, 252 transitions, 4536 flow [2022-12-06 05:16:06,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4260, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4536, PETRI_PLACES=137, PETRI_TRANSITIONS=252} [2022-12-06 05:16:06,044 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2022-12-06 05:16:06,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:06,045 INFO L89 Accepts]: Start accepts. Operand has 137 places, 252 transitions, 4536 flow [2022-12-06 05:16:06,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:06,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:06,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 252 transitions, 4536 flow [2022-12-06 05:16:06,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 252 transitions, 4536 flow [2022-12-06 05:16:06,125 INFO L130 PetriNetUnfolder]: 350/1027 cut-off events. [2022-12-06 05:16:06,125 INFO L131 PetriNetUnfolder]: For 9379/9473 co-relation queries the response was YES. [2022-12-06 05:16:06,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1027 events. 350/1027 cut-off events. For 9379/9473 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7543 event pairs, 0 based on Foata normal form. 41/1037 useless extension candidates. Maximal degree in co-relation 4818. Up to 198 conditions per place. [2022-12-06 05:16:06,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 252 transitions, 4536 flow [2022-12-06 05:16:06,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 1898 [2022-12-06 05:16:06,145 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:06,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 05:16:06,145 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 252 transitions, 4536 flow [2022-12-06 05:16:06,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:06,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:06,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:06,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 05:16:06,146 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:06,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:06,146 INFO L85 PathProgramCache]: Analyzing trace with hash -201703975, now seen corresponding path program 1 times [2022-12-06 05:16:06,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:06,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628612472] [2022-12-06 05:16:06,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:06,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:06,318 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-06 05:16:06,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:06,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628612472] [2022-12-06 05:16:06,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628612472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:16:06,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917955180] [2022-12-06 05:16:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:16:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:16:06,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:16:06,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:16:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:06,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:16:06,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:16:06,686 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-06 05:16:06,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:16:06,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917955180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:06,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:16:06,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2022-12-06 05:16:06,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362856440] [2022-12-06 05:16:06,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:06,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:06,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:16:06,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:16:06,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 252 transitions, 4536 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:06,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:06,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:16:06,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:08,152 INFO L130 PetriNetUnfolder]: 8527/12416 cut-off events. [2022-12-06 05:16:08,152 INFO L131 PetriNetUnfolder]: For 107642/107642 co-relation queries the response was YES. [2022-12-06 05:16:08,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71358 conditions, 12416 events. 8527/12416 cut-off events. For 107642/107642 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 70490 event pairs, 3549 based on Foata normal form. 4/12386 useless extension candidates. Maximal degree in co-relation 58707. Up to 3795 conditions per place. [2022-12-06 05:16:08,224 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 316 selfloop transitions, 108 changer transitions 43/468 dead transitions. [2022-12-06 05:16:08,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 468 transitions, 8764 flow [2022-12-06 05:16:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-06 05:16:08,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 05:16:08,225 INFO L175 Difference]: Start difference. First operand has 137 places, 252 transitions, 4536 flow. Second operand 6 states and 132 transitions. [2022-12-06 05:16:08,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 468 transitions, 8764 flow [2022-12-06 05:16:08,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 468 transitions, 8760 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:16:08,321 INFO L231 Difference]: Finished difference. Result has 143 places, 292 transitions, 5499 flow [2022-12-06 05:16:08,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4533, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5499, PETRI_PLACES=143, PETRI_TRANSITIONS=292} [2022-12-06 05:16:08,321 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2022-12-06 05:16:08,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:08,322 INFO L89 Accepts]: Start accepts. Operand has 143 places, 292 transitions, 5499 flow [2022-12-06 05:16:08,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:08,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:08,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 292 transitions, 5499 flow [2022-12-06 05:16:08,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 292 transitions, 5499 flow [2022-12-06 05:16:08,426 INFO L130 PetriNetUnfolder]: 472/1287 cut-off events. [2022-12-06 05:16:08,426 INFO L131 PetriNetUnfolder]: For 13743/13866 co-relation queries the response was YES. [2022-12-06 05:16:08,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7798 conditions, 1287 events. 472/1287 cut-off events. For 13743/13866 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9406 event pairs, 0 based on Foata normal form. 53/1297 useless extension candidates. Maximal degree in co-relation 6198. Up to 276 conditions per place. [2022-12-06 05:16:08,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 292 transitions, 5499 flow [2022-12-06 05:16:08,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 2124 [2022-12-06 05:16:08,452 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:08,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 05:16:08,453 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 292 transitions, 5499 flow [2022-12-06 05:16:08,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:08,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:08,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:08,458 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-06 05:16:08,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 05:16:08,658 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2144975828, now seen corresponding path program 1 times [2022-12-06 05:16:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:08,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408168261] [2022-12-06 05:16:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:08,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408168261] [2022-12-06 05:16:08,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408168261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:08,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:08,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761351660] [2022-12-06 05:16:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:08,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:08,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:08,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 05:16:08,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 292 transitions, 5499 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:08,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:08,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 05:16:08,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:10,089 INFO L130 PetriNetUnfolder]: 6399/9198 cut-off events. [2022-12-06 05:16:10,089 INFO L131 PetriNetUnfolder]: For 87162/87162 co-relation queries the response was YES. [2022-12-06 05:16:10,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54895 conditions, 9198 events. 6399/9198 cut-off events. For 87162/87162 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 46461 event pairs, 2941 based on Foata normal form. 308/9153 useless extension candidates. Maximal degree in co-relation 50091. Up to 7619 conditions per place. [2022-12-06 05:16:10,170 INFO L137 encePairwiseOnDemand]: 40/45 looper letters, 168 selfloop transitions, 0 changer transitions 124/292 dead transitions. [2022-12-06 05:16:10,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 292 transitions, 5755 flow [2022-12-06 05:16:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 05:16:10,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 05:16:10,171 INFO L175 Difference]: Start difference. First operand has 143 places, 292 transitions, 5499 flow. Second operand 4 states and 87 transitions. [2022-12-06 05:16:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 292 transitions, 5755 flow [2022-12-06 05:16:10,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 292 transitions, 5586 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:10,279 INFO L231 Difference]: Finished difference. Result has 142 places, 168 transitions, 2798 flow [2022-12-06 05:16:10,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4146, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2798, PETRI_PLACES=142, PETRI_TRANSITIONS=168} [2022-12-06 05:16:10,280 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 104 predicate places. [2022-12-06 05:16:10,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:10,280 INFO L89 Accepts]: Start accepts. Operand has 142 places, 168 transitions, 2798 flow [2022-12-06 05:16:10,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:10,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:10,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 168 transitions, 2798 flow [2022-12-06 05:16:10,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 168 transitions, 2798 flow [2022-12-06 05:16:10,344 INFO L130 PetriNetUnfolder]: 260/683 cut-off events. [2022-12-06 05:16:10,344 INFO L131 PetriNetUnfolder]: For 6570/6628 co-relation queries the response was YES. [2022-12-06 05:16:10,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 683 events. 260/683 cut-off events. For 6570/6628 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4147 event pairs, 0 based on Foata normal form. 26/684 useless extension candidates. Maximal degree in co-relation 3277. Up to 154 conditions per place. [2022-12-06 05:16:10,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 168 transitions, 2798 flow [2022-12-06 05:16:10,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-06 05:16:14,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:14,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3822 [2022-12-06 05:16:14,102 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 168 transitions, 2840 flow [2022-12-06 05:16:14,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:14,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:14,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:14,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 05:16:14,103 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash 733006512, now seen corresponding path program 1 times [2022-12-06 05:16:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:14,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111027871] [2022-12-06 05:16:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:14,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:14,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111027871] [2022-12-06 05:16:14,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111027871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:14,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:14,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:16:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597847796] [2022-12-06 05:16:14,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:14,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:14,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:16:14,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 168 transitions, 2840 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:14,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:14,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:16:14,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:14,831 INFO L130 PetriNetUnfolder]: 3737/5321 cut-off events. [2022-12-06 05:16:14,832 INFO L131 PetriNetUnfolder]: For 47692/47692 co-relation queries the response was YES. [2022-12-06 05:16:14,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31887 conditions, 5321 events. 3737/5321 cut-off events. For 47692/47692 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 25585 event pairs, 1717 based on Foata normal form. 62/5360 useless extension candidates. Maximal degree in co-relation 28023. Up to 4942 conditions per place. [2022-12-06 05:16:14,861 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 141 selfloop transitions, 0 changer transitions 71/213 dead transitions. [2022-12-06 05:16:14,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 213 transitions, 3732 flow [2022-12-06 05:16:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 05:16:14,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4943181818181818 [2022-12-06 05:16:14,884 INFO L175 Difference]: Start difference. First operand has 128 places, 168 transitions, 2840 flow. Second operand 4 states and 87 transitions. [2022-12-06 05:16:14,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 213 transitions, 3732 flow [2022-12-06 05:16:14,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 213 transitions, 3483 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-12-06 05:16:14,986 INFO L231 Difference]: Finished difference. Result has 125 places, 142 transitions, 2136 flow [2022-12-06 05:16:14,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2136, PETRI_PLACES=125, PETRI_TRANSITIONS=142} [2022-12-06 05:16:14,986 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 87 predicate places. [2022-12-06 05:16:14,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:14,987 INFO L89 Accepts]: Start accepts. Operand has 125 places, 142 transitions, 2136 flow [2022-12-06 05:16:14,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:14,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:14,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 142 transitions, 2136 flow [2022-12-06 05:16:14,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 142 transitions, 2136 flow [2022-12-06 05:16:15,030 INFO L130 PetriNetUnfolder]: 190/488 cut-off events. [2022-12-06 05:16:15,030 INFO L131 PetriNetUnfolder]: For 3986/4044 co-relation queries the response was YES. [2022-12-06 05:16:15,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 488 events. 190/488 cut-off events. For 3986/4044 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2652 event pairs, 0 based on Foata normal form. 22/489 useless extension candidates. Maximal degree in co-relation 2119. Up to 117 conditions per place. [2022-12-06 05:16:15,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 142 transitions, 2136 flow [2022-12-06 05:16:15,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 1062 [2022-12-06 05:16:20,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:20,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5189 [2022-12-06 05:16:20,176 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 142 transitions, 2176 flow [2022-12-06 05:16:20,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:20,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:20,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:20,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 05:16:20,176 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1871313740, now seen corresponding path program 1 times [2022-12-06 05:16:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151777169] [2022-12-06 05:16:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:20,364 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-06 05:16:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:20,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151777169] [2022-12-06 05:16:20,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151777169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:16:20,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662874721] [2022-12-06 05:16:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:20,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:16:20,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:16:20,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:16:20,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:16:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:20,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:16:20,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:16:20,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:20,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 74 [2022-12-06 05:16:20,804 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-06 05:16:20,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:16:20,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:20,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-12-06 05:16:21,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-06 05:16:21,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662874721] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:16:21,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:16:21,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 05:16:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560009567] [2022-12-06 05:16:21,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:16:21,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 05:16:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 05:16:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-12-06 05:16:21,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:16:21,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 142 transitions, 2176 flow. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:21,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:21,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:16:21,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:23,327 INFO L130 PetriNetUnfolder]: 8799/12747 cut-off events. [2022-12-06 05:16:23,327 INFO L131 PetriNetUnfolder]: For 86401/86401 co-relation queries the response was YES. [2022-12-06 05:16:23,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70887 conditions, 12747 events. 8799/12747 cut-off events. For 86401/86401 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 72545 event pairs, 2100 based on Foata normal form. 176/12889 useless extension candidates. Maximal degree in co-relation 56956. Up to 1997 conditions per place. [2022-12-06 05:16:23,548 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 355 selfloop transitions, 124 changer transitions 161/641 dead transitions. [2022-12-06 05:16:23,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 641 transitions, 9230 flow [2022-12-06 05:16:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 05:16:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 05:16:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 373 transitions. [2022-12-06 05:16:23,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35321969696969696 [2022-12-06 05:16:23,550 INFO L175 Difference]: Start difference. First operand has 119 places, 142 transitions, 2176 flow. Second operand 24 states and 373 transitions. [2022-12-06 05:16:23,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 641 transitions, 9230 flow [2022-12-06 05:16:23,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 641 transitions, 8800 flow, removed 68 selfloop flow, removed 5 redundant places. [2022-12-06 05:16:23,648 INFO L231 Difference]: Finished difference. Result has 153 places, 224 transitions, 4211 flow [2022-12-06 05:16:23,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4211, PETRI_PLACES=153, PETRI_TRANSITIONS=224} [2022-12-06 05:16:23,648 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2022-12-06 05:16:23,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:23,648 INFO L89 Accepts]: Start accepts. Operand has 153 places, 224 transitions, 4211 flow [2022-12-06 05:16:23,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:23,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:23,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 224 transitions, 4211 flow [2022-12-06 05:16:23,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 224 transitions, 4211 flow [2022-12-06 05:16:23,738 INFO L130 PetriNetUnfolder]: 361/1100 cut-off events. [2022-12-06 05:16:23,739 INFO L131 PetriNetUnfolder]: For 9589/9697 co-relation queries the response was YES. [2022-12-06 05:16:23,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 1100 events. 361/1100 cut-off events. For 9589/9697 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8332 event pairs, 0 based on Foata normal form. 45/1110 useless extension candidates. Maximal degree in co-relation 5655. Up to 210 conditions per place. [2022-12-06 05:16:23,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 224 transitions, 4211 flow [2022-12-06 05:16:23,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 1670 [2022-12-06 05:16:24,330 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:24,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 683 [2022-12-06 05:16:24,331 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 223 transitions, 4210 flow [2022-12-06 05:16:24,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:24,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:24,331 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:24,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:16:24,536 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,SelfDestructingSolverStorable42 [2022-12-06 05:16:24,536 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash -560612633, now seen corresponding path program 1 times [2022-12-06 05:16:24,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:24,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781029444] [2022-12-06 05:16:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:24,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:24,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781029444] [2022-12-06 05:16:24,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781029444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:24,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:24,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381043037] [2022-12-06 05:16:24,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:24,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:24,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-06 05:16:24,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 223 transitions, 4210 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:24,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:24,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-06 05:16:24,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:26,248 INFO L130 PetriNetUnfolder]: 8893/12972 cut-off events. [2022-12-06 05:16:26,248 INFO L131 PetriNetUnfolder]: For 119031/119031 co-relation queries the response was YES. [2022-12-06 05:16:26,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76324 conditions, 12972 events. 8893/12972 cut-off events. For 119031/119031 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 74623 event pairs, 4152 based on Foata normal form. 236/13145 useless extension candidates. Maximal degree in co-relation 76175. Up to 10097 conditions per place. [2022-12-06 05:16:26,322 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 262 selfloop transitions, 3 changer transitions 88/354 dead transitions. [2022-12-06 05:16:26,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 354 transitions, 6618 flow [2022-12-06 05:16:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-06 05:16:26,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2022-12-06 05:16:26,324 INFO L175 Difference]: Start difference. First operand has 143 places, 223 transitions, 4210 flow. Second operand 6 states and 119 transitions. [2022-12-06 05:16:26,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 354 transitions, 6618 flow [2022-12-06 05:16:26,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 354 transitions, 6466 flow, removed 55 selfloop flow, removed 11 redundant places. [2022-12-06 05:16:26,806 INFO L231 Difference]: Finished difference. Result has 141 places, 225 transitions, 4168 flow [2022-12-06 05:16:26,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4082, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4168, PETRI_PLACES=141, PETRI_TRANSITIONS=225} [2022-12-06 05:16:26,806 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2022-12-06 05:16:26,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:26,807 INFO L89 Accepts]: Start accepts. Operand has 141 places, 225 transitions, 4168 flow [2022-12-06 05:16:26,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:26,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:26,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 225 transitions, 4168 flow [2022-12-06 05:16:26,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 225 transitions, 4168 flow [2022-12-06 05:16:26,901 INFO L130 PetriNetUnfolder]: 381/1163 cut-off events. [2022-12-06 05:16:26,901 INFO L131 PetriNetUnfolder]: For 9356/9481 co-relation queries the response was YES. [2022-12-06 05:16:26,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 1163 events. 381/1163 cut-off events. For 9356/9481 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8834 event pairs, 0 based on Foata normal form. 55/1180 useless extension candidates. Maximal degree in co-relation 5865. Up to 226 conditions per place. [2022-12-06 05:16:26,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 225 transitions, 4168 flow [2022-12-06 05:16:26,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 1670 [2022-12-06 05:16:32,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:32,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5611 [2022-12-06 05:16:32,418 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 225 transitions, 4206 flow [2022-12-06 05:16:32,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:32,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:32,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:32,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 05:16:32,418 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1307663406, now seen corresponding path program 1 times [2022-12-06 05:16:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:32,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238855657] [2022-12-06 05:16:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:32,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238855657] [2022-12-06 05:16:32,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238855657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:32,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:32,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916197606] [2022-12-06 05:16:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:32,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:32,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:16:32,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 225 transitions, 4206 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:32,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:32,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:16:32,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:33,523 INFO L130 PetriNetUnfolder]: 6732/9886 cut-off events. [2022-12-06 05:16:33,524 INFO L131 PetriNetUnfolder]: For 92415/92415 co-relation queries the response was YES. [2022-12-06 05:16:33,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53688 conditions, 9886 events. 6732/9886 cut-off events. For 92415/92415 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 54594 event pairs, 692 based on Foata normal form. 500/10383 useless extension candidates. Maximal degree in co-relation 53601. Up to 7076 conditions per place. [2022-12-06 05:16:33,579 INFO L137 encePairwiseOnDemand]: 43/47 looper letters, 200 selfloop transitions, 20 changer transitions 11/232 dead transitions. [2022-12-06 05:16:33,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 232 transitions, 4439 flow [2022-12-06 05:16:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 05:16:33,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2022-12-06 05:16:33,580 INFO L175 Difference]: Start difference. First operand has 139 places, 225 transitions, 4206 flow. Second operand 4 states and 84 transitions. [2022-12-06 05:16:33,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 232 transitions, 4439 flow [2022-12-06 05:16:33,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 232 transitions, 3901 flow, removed 23 selfloop flow, removed 11 redundant places. [2022-12-06 05:16:33,795 INFO L231 Difference]: Finished difference. Result has 126 places, 192 transitions, 3181 flow [2022-12-06 05:16:33,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3348, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3181, PETRI_PLACES=126, PETRI_TRANSITIONS=192} [2022-12-06 05:16:33,795 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2022-12-06 05:16:33,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:33,796 INFO L89 Accepts]: Start accepts. Operand has 126 places, 192 transitions, 3181 flow [2022-12-06 05:16:33,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:33,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:33,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 192 transitions, 3181 flow [2022-12-06 05:16:33,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 192 transitions, 3181 flow [2022-12-06 05:16:33,933 INFO L130 PetriNetUnfolder]: 299/866 cut-off events. [2022-12-06 05:16:33,933 INFO L131 PetriNetUnfolder]: For 6287/6376 co-relation queries the response was YES. [2022-12-06 05:16:33,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 866 events. 299/866 cut-off events. For 6287/6376 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5974 event pairs, 0 based on Foata normal form. 31/861 useless extension candidates. Maximal degree in co-relation 3939. Up to 168 conditions per place. [2022-12-06 05:16:33,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 192 transitions, 3181 flow [2022-12-06 05:16:33,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 1374 [2022-12-06 05:16:34,506 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:34,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 712 [2022-12-06 05:16:34,507 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 192 transitions, 3185 flow [2022-12-06 05:16:34,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:34,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:34,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:34,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 05:16:34,507 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1879050517, now seen corresponding path program 1 times [2022-12-06 05:16:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:34,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245034198] [2022-12-06 05:16:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:34,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245034198] [2022-12-06 05:16:34,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245034198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:34,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:34,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582885825] [2022-12-06 05:16:34,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:34,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:34,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:34,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 05:16:34,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 192 transitions, 3185 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-06 05:16:34,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:34,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 05:16:34,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:35,976 INFO L130 PetriNetUnfolder]: 10068/14493 cut-off events. [2022-12-06 05:16:35,976 INFO L131 PetriNetUnfolder]: For 97506/97506 co-relation queries the response was YES. [2022-12-06 05:16:36,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70332 conditions, 14493 events. 10068/14493 cut-off events. For 97506/97506 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 79462 event pairs, 4483 based on Foata normal form. 156/13952 useless extension candidates. Maximal degree in co-relation 68193. Up to 9270 conditions per place. [2022-12-06 05:16:36,060 INFO L137 encePairwiseOnDemand]: 40/45 looper letters, 335 selfloop transitions, 12 changer transitions 1/348 dead transitions. [2022-12-06 05:16:36,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 348 transitions, 5953 flow [2022-12-06 05:16:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-12-06 05:16:36,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 05:16:36,061 INFO L175 Difference]: Start difference. First operand has 121 places, 192 transitions, 3185 flow. Second operand 4 states and 105 transitions. [2022-12-06 05:16:36,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 348 transitions, 5953 flow [2022-12-06 05:16:36,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 348 transitions, 5751 flow, removed 84 selfloop flow, removed 8 redundant places. [2022-12-06 05:16:36,443 INFO L231 Difference]: Finished difference. Result has 118 places, 202 transitions, 3293 flow [2022-12-06 05:16:36,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3073, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3293, PETRI_PLACES=118, PETRI_TRANSITIONS=202} [2022-12-06 05:16:36,444 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2022-12-06 05:16:36,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:36,444 INFO L89 Accepts]: Start accepts. Operand has 118 places, 202 transitions, 3293 flow [2022-12-06 05:16:36,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:36,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:36,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 202 transitions, 3293 flow [2022-12-06 05:16:36,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 202 transitions, 3293 flow [2022-12-06 05:16:36,543 INFO L130 PetriNetUnfolder]: 414/1300 cut-off events. [2022-12-06 05:16:36,543 INFO L131 PetriNetUnfolder]: For 7780/7894 co-relation queries the response was YES. [2022-12-06 05:16:36,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 1300 events. 414/1300 cut-off events. For 7780/7894 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10255 event pairs, 0 based on Foata normal form. 40/1305 useless extension candidates. Maximal degree in co-relation 4663. Up to 231 conditions per place. [2022-12-06 05:16:36,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 202 transitions, 3293 flow [2022-12-06 05:16:36,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 1514 [2022-12-06 05:16:36,565 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:36,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 05:16:36,566 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 202 transitions, 3293 flow [2022-12-06 05:16:36,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-06 05:16:36,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:36,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:36,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 05:16:36,566 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash 367747665, now seen corresponding path program 1 times [2022-12-06 05:16:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:36,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099146663] [2022-12-06 05:16:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:36,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:36,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099146663] [2022-12-06 05:16:36,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099146663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:36,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:36,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:36,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278374301] [2022-12-06 05:16:36,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:36,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:36,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:36,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:36,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:36,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:16:36,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 202 transitions, 3293 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:36,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:36,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:16:36,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:37,991 INFO L130 PetriNetUnfolder]: 7926/11780 cut-off events. [2022-12-06 05:16:37,991 INFO L131 PetriNetUnfolder]: For 63899/63899 co-relation queries the response was YES. [2022-12-06 05:16:38,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57227 conditions, 11780 events. 7926/11780 cut-off events. For 63899/63899 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 68772 event pairs, 3795 based on Foata normal form. 236/11979 useless extension candidates. Maximal degree in co-relation 52921. Up to 9368 conditions per place. [2022-12-06 05:16:38,050 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 144 selfloop transitions, 3 changer transitions 110/258 dead transitions. [2022-12-06 05:16:38,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 258 transitions, 4014 flow [2022-12-06 05:16:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 05:16:38,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 05:16:38,051 INFO L175 Difference]: Start difference. First operand has 117 places, 202 transitions, 3293 flow. Second operand 6 states and 108 transitions. [2022-12-06 05:16:38,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 258 transitions, 4014 flow [2022-12-06 05:16:38,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 258 transitions, 3999 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:16:38,202 INFO L231 Difference]: Finished difference. Result has 122 places, 148 transitions, 2180 flow [2022-12-06 05:16:38,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2180, PETRI_PLACES=122, PETRI_TRANSITIONS=148} [2022-12-06 05:16:38,203 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 84 predicate places. [2022-12-06 05:16:38,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:38,203 INFO L89 Accepts]: Start accepts. Operand has 122 places, 148 transitions, 2180 flow [2022-12-06 05:16:38,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:38,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:38,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 148 transitions, 2180 flow [2022-12-06 05:16:38,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 148 transitions, 2180 flow [2022-12-06 05:16:38,273 INFO L130 PetriNetUnfolder]: 302/973 cut-off events. [2022-12-06 05:16:38,273 INFO L131 PetriNetUnfolder]: For 5506/5591 co-relation queries the response was YES. [2022-12-06 05:16:38,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4276 conditions, 973 events. 302/973 cut-off events. For 5506/5591 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7325 event pairs, 0 based on Foata normal form. 24/970 useless extension candidates. Maximal degree in co-relation 4206. Up to 166 conditions per place. [2022-12-06 05:16:38,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 148 transitions, 2180 flow [2022-12-06 05:16:38,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 1112 [2022-12-06 05:16:38,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:38,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 05:16:38,287 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 148 transitions, 2180 flow [2022-12-06 05:16:38,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:38,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:38,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:38,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 05:16:38,287 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:38,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1732283600, now seen corresponding path program 1 times [2022-12-06 05:16:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:38,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555937118] [2022-12-06 05:16:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:38,349 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-06 05:16:38,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:38,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555937118] [2022-12-06 05:16:38,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555937118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:38,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:38,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669084523] [2022-12-06 05:16:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:38,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:38,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:38,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:16:38,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 148 transitions, 2180 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:38,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:38,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:16:38,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:39,711 INFO L130 PetriNetUnfolder]: 10839/15816 cut-off events. [2022-12-06 05:16:39,711 INFO L131 PetriNetUnfolder]: For 91050/91050 co-relation queries the response was YES. [2022-12-06 05:16:39,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74478 conditions, 15816 events. 10839/15816 cut-off events. For 91050/91050 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 90177 event pairs, 3702 based on Foata normal form. 312/16124 useless extension candidates. Maximal degree in co-relation 74347. Up to 8851 conditions per place. [2022-12-06 05:16:39,942 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 203 selfloop transitions, 27 changer transitions 0/230 dead transitions. [2022-12-06 05:16:39,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 230 transitions, 3779 flow [2022-12-06 05:16:39,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 05:16:39,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33488372093023255 [2022-12-06 05:16:39,943 INFO L175 Difference]: Start difference. First operand has 115 places, 148 transitions, 2180 flow. Second operand 5 states and 72 transitions. [2022-12-06 05:16:39,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 230 transitions, 3779 flow [2022-12-06 05:16:40,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 230 transitions, 3712 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-06 05:16:40,170 INFO L231 Difference]: Finished difference. Result has 115 places, 149 transitions, 2249 flow [2022-12-06 05:16:40,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2249, PETRI_PLACES=115, PETRI_TRANSITIONS=149} [2022-12-06 05:16:40,171 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2022-12-06 05:16:40,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:40,171 INFO L89 Accepts]: Start accepts. Operand has 115 places, 149 transitions, 2249 flow [2022-12-06 05:16:40,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:40,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:40,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 149 transitions, 2249 flow [2022-12-06 05:16:40,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 149 transitions, 2249 flow [2022-12-06 05:16:40,262 INFO L130 PetriNetUnfolder]: 355/1216 cut-off events. [2022-12-06 05:16:40,262 INFO L131 PetriNetUnfolder]: For 7028/7164 co-relation queries the response was YES. [2022-12-06 05:16:40,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 1216 events. 355/1216 cut-off events. For 7028/7164 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9977 event pairs, 0 based on Foata normal form. 23/1194 useless extension candidates. Maximal degree in co-relation 4293. Up to 205 conditions per place. [2022-12-06 05:16:40,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 149 transitions, 2249 flow [2022-12-06 05:16:40,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-06 05:16:40,279 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:40,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 05:16:40,279 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 149 transitions, 2249 flow [2022-12-06 05:16:40,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:40,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:40,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:40,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 05:16:40,279 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1365308623, now seen corresponding path program 1 times [2022-12-06 05:16:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483305965] [2022-12-06 05:16:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:40,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483305965] [2022-12-06 05:16:40,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483305965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:40,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:40,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384822365] [2022-12-06 05:16:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:40,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:40,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:40,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:40,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:40,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 149 transitions, 2249 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-06 05:16:40,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:40,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:40,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:41,663 INFO L130 PetriNetUnfolder]: 9250/13883 cut-off events. [2022-12-06 05:16:41,663 INFO L131 PetriNetUnfolder]: For 70312/70312 co-relation queries the response was YES. [2022-12-06 05:16:41,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65973 conditions, 13883 events. 9250/13883 cut-off events. For 70312/70312 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 83730 event pairs, 3155 based on Foata normal form. 6/13882 useless extension candidates. Maximal degree in co-relation 60129. Up to 6140 conditions per place. [2022-12-06 05:16:41,740 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 207 selfloop transitions, 49 changer transitions 31/288 dead transitions. [2022-12-06 05:16:41,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 288 transitions, 4328 flow [2022-12-06 05:16:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-12-06 05:16:41,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2022-12-06 05:16:41,741 INFO L175 Difference]: Start difference. First operand has 115 places, 149 transitions, 2249 flow. Second operand 6 states and 128 transitions. [2022-12-06 05:16:41,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 288 transitions, 4328 flow [2022-12-06 05:16:41,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 288 transitions, 4252 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:41,838 INFO L231 Difference]: Finished difference. Result has 118 places, 159 transitions, 2455 flow [2022-12-06 05:16:41,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2455, PETRI_PLACES=118, PETRI_TRANSITIONS=159} [2022-12-06 05:16:41,841 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2022-12-06 05:16:41,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:41,842 INFO L89 Accepts]: Start accepts. Operand has 118 places, 159 transitions, 2455 flow [2022-12-06 05:16:41,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:41,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:41,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 159 transitions, 2455 flow [2022-12-06 05:16:41,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 159 transitions, 2455 flow [2022-12-06 05:16:41,923 INFO L130 PetriNetUnfolder]: 335/1186 cut-off events. [2022-12-06 05:16:41,923 INFO L131 PetriNetUnfolder]: For 7198/7296 co-relation queries the response was YES. [2022-12-06 05:16:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 1186 events. 335/1186 cut-off events. For 7198/7296 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9844 event pairs, 0 based on Foata normal form. 22/1162 useless extension candidates. Maximal degree in co-relation 4282. Up to 196 conditions per place. [2022-12-06 05:16:41,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 159 transitions, 2455 flow [2022-12-06 05:16:41,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 1256 [2022-12-06 05:16:41,938 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:41,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 05:16:41,939 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 159 transitions, 2455 flow [2022-12-06 05:16:41,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-06 05:16:41,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:41,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:41,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 05:16:41,939 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:41,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash 612832168, now seen corresponding path program 1 times [2022-12-06 05:16:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:41,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243996376] [2022-12-06 05:16:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:41,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:42,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243996376] [2022-12-06 05:16:42,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243996376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:42,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:42,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 05:16:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948997815] [2022-12-06 05:16:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:42,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:16:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:16:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:16:42,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:16:42,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 159 transitions, 2455 flow. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:42,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:42,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:16:42,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:45,125 INFO L130 PetriNetUnfolder]: 11030/16153 cut-off events. [2022-12-06 05:16:45,126 INFO L131 PetriNetUnfolder]: For 88758/88758 co-relation queries the response was YES. [2022-12-06 05:16:45,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76621 conditions, 16153 events. 11030/16153 cut-off events. For 88758/88758 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 93025 event pairs, 5543 based on Foata normal form. 1/16150 useless extension candidates. Maximal degree in co-relation 70028. Up to 10593 conditions per place. [2022-12-06 05:16:45,220 INFO L137 encePairwiseOnDemand]: 27/43 looper letters, 302 selfloop transitions, 51 changer transitions 11/364 dead transitions. [2022-12-06 05:16:45,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 364 transitions, 5646 flow [2022-12-06 05:16:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:16:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:16:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2022-12-06 05:16:45,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3627906976744186 [2022-12-06 05:16:45,221 INFO L175 Difference]: Start difference. First operand has 118 places, 159 transitions, 2455 flow. Second operand 10 states and 156 transitions. [2022-12-06 05:16:45,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 364 transitions, 5646 flow [2022-12-06 05:16:45,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 364 transitions, 5539 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:45,349 INFO L231 Difference]: Finished difference. Result has 132 places, 211 transitions, 3517 flow [2022-12-06 05:16:45,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3517, PETRI_PLACES=132, PETRI_TRANSITIONS=211} [2022-12-06 05:16:45,349 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2022-12-06 05:16:45,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:45,349 INFO L89 Accepts]: Start accepts. Operand has 132 places, 211 transitions, 3517 flow [2022-12-06 05:16:45,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:45,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:45,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 211 transitions, 3517 flow [2022-12-06 05:16:45,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 211 transitions, 3517 flow [2022-12-06 05:16:45,489 INFO L130 PetriNetUnfolder]: 619/1797 cut-off events. [2022-12-06 05:16:45,490 INFO L131 PetriNetUnfolder]: For 14452/14735 co-relation queries the response was YES. [2022-12-06 05:16:45,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8972 conditions, 1797 events. 619/1797 cut-off events. For 14452/14735 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 15438 event pairs, 103 based on Foata normal form. 49/1734 useless extension candidates. Maximal degree in co-relation 8873. Up to 362 conditions per place. [2022-12-06 05:16:45,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 211 transitions, 3517 flow [2022-12-06 05:16:45,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-06 05:16:45,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:16:45,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:16:45,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:45,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 539 [2022-12-06 05:16:45,889 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 210 transitions, 3544 flow [2022-12-06 05:16:45,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:45,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:45,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:45,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 05:16:45,889 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash -734892427, now seen corresponding path program 1 times [2022-12-06 05:16:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:45,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412100869] [2022-12-06 05:16:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:46,007 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-06 05:16:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:46,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412100869] [2022-12-06 05:16:46,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412100869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:46,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:46,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168053757] [2022-12-06 05:16:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:46,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:46,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-06 05:16:46,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 210 transitions, 3544 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:46,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:46,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-06 05:16:46,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:49,289 INFO L130 PetriNetUnfolder]: 18885/28493 cut-off events. [2022-12-06 05:16:49,289 INFO L131 PetriNetUnfolder]: For 190412/190412 co-relation queries the response was YES. [2022-12-06 05:16:49,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147874 conditions, 28493 events. 18885/28493 cut-off events. For 190412/190412 co-relation queries the response was YES. Maximal size of possible extension queue 1160. Compared 192993 event pairs, 4756 based on Foata normal form. 12/28490 useless extension candidates. Maximal degree in co-relation 147630. Up to 6359 conditions per place. [2022-12-06 05:16:49,530 INFO L137 encePairwiseOnDemand]: 32/47 looper letters, 447 selfloop transitions, 129 changer transitions 70/647 dead transitions. [2022-12-06 05:16:49,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 647 transitions, 10999 flow [2022-12-06 05:16:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:16:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:16:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2022-12-06 05:16:49,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46170212765957447 [2022-12-06 05:16:49,532 INFO L175 Difference]: Start difference. First operand has 129 places, 210 transitions, 3544 flow. Second operand 10 states and 217 transitions. [2022-12-06 05:16:49,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 647 transitions, 10999 flow [2022-12-06 05:16:50,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 647 transitions, 10937 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 05:16:50,178 INFO L231 Difference]: Finished difference. Result has 140 places, 281 transitions, 5163 flow [2022-12-06 05:16:50,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3514, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5163, PETRI_PLACES=140, PETRI_TRANSITIONS=281} [2022-12-06 05:16:50,179 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2022-12-06 05:16:50,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:50,179 INFO L89 Accepts]: Start accepts. Operand has 140 places, 281 transitions, 5163 flow [2022-12-06 05:16:50,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:50,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:50,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 281 transitions, 5163 flow [2022-12-06 05:16:50,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 281 transitions, 5163 flow [2022-12-06 05:16:50,532 INFO L130 PetriNetUnfolder]: 1182/3534 cut-off events. [2022-12-06 05:16:50,532 INFO L131 PetriNetUnfolder]: For 30773/31359 co-relation queries the response was YES. [2022-12-06 05:16:50,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18147 conditions, 3534 events. 1182/3534 cut-off events. For 30773/31359 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 35081 event pairs, 156 based on Foata normal form. 117/3459 useless extension candidates. Maximal degree in co-relation 16359. Up to 696 conditions per place. [2022-12-06 05:16:50,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 281 transitions, 5163 flow [2022-12-06 05:16:50,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 2108 [2022-12-06 05:16:51,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:51,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1303 [2022-12-06 05:16:51,482 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 281 transitions, 5165 flow [2022-12-06 05:16:51,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:51,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:51,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:51,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 05:16:51,482 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:51,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash -339816289, now seen corresponding path program 1 times [2022-12-06 05:16:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:51,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932342727] [2022-12-06 05:16:51,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:52,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:52,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932342727] [2022-12-06 05:16:52,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932342727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:52,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:52,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 05:16:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052504676] [2022-12-06 05:16:52,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:16:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:16:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:16:52,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:16:52,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 281 transitions, 5165 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:52,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:52,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:16:52,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:56,763 INFO L130 PetriNetUnfolder]: 22049/32349 cut-off events. [2022-12-06 05:16:56,763 INFO L131 PetriNetUnfolder]: For 239355/239355 co-relation queries the response was YES. [2022-12-06 05:16:56,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171139 conditions, 32349 events. 22049/32349 cut-off events. For 239355/239355 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 207176 event pairs, 11032 based on Foata normal form. 2/32350 useless extension candidates. Maximal degree in co-relation 154860. Up to 21005 conditions per place. [2022-12-06 05:16:57,029 INFO L137 encePairwiseOnDemand]: 33/49 looper letters, 383 selfloop transitions, 85 changer transitions 11/479 dead transitions. [2022-12-06 05:16:57,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 479 transitions, 8929 flow [2022-12-06 05:16:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:16:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:16:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-06 05:16:57,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2022-12-06 05:16:57,031 INFO L175 Difference]: Start difference. First operand has 140 places, 281 transitions, 5165 flow. Second operand 9 states and 154 transitions. [2022-12-06 05:16:57,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 479 transitions, 8929 flow [2022-12-06 05:16:57,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 479 transitions, 8716 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:57,573 INFO L231 Difference]: Finished difference. Result has 149 places, 312 transitions, 5999 flow [2022-12-06 05:16:57,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5010, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5999, PETRI_PLACES=149, PETRI_TRANSITIONS=312} [2022-12-06 05:16:57,574 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2022-12-06 05:16:57,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:57,574 INFO L89 Accepts]: Start accepts. Operand has 149 places, 312 transitions, 5999 flow [2022-12-06 05:16:57,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:57,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:57,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 312 transitions, 5999 flow [2022-12-06 05:16:57,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 312 transitions, 5999 flow [2022-12-06 05:16:57,967 INFO L130 PetriNetUnfolder]: 1235/3564 cut-off events. [2022-12-06 05:16:57,967 INFO L131 PetriNetUnfolder]: For 36284/36962 co-relation queries the response was YES. [2022-12-06 05:16:57,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19442 conditions, 3564 events. 1235/3564 cut-off events. For 36284/36962 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 34947 event pairs, 152 based on Foata normal form. 134/3499 useless extension candidates. Maximal degree in co-relation 19266. Up to 732 conditions per place. [2022-12-06 05:16:58,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 312 transitions, 5999 flow [2022-12-06 05:16:58,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 2270 [2022-12-06 05:16:58,023 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:58,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 450 [2022-12-06 05:16:58,024 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 312 transitions, 5999 flow [2022-12-06 05:16:58,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:58,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:58,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:58,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 05:16:58,024 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash 870752006, now seen corresponding path program 2 times [2022-12-06 05:16:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:58,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191053712] [2022-12-06 05:16:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:58,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191053712] [2022-12-06 05:16:58,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191053712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:58,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:58,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 05:16:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231064992] [2022-12-06 05:16:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:58,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:16:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:16:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:16:58,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:16:58,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 312 transitions, 5999 flow. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:58,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:58,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:16:58,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:04,401 INFO L130 PetriNetUnfolder]: 23333/34184 cut-off events. [2022-12-06 05:17:04,402 INFO L131 PetriNetUnfolder]: For 275988/275988 co-relation queries the response was YES. [2022-12-06 05:17:04,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187471 conditions, 34184 events. 23333/34184 cut-off events. For 275988/275988 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 219788 event pairs, 6964 based on Foata normal form. 2/34185 useless extension candidates. Maximal degree in co-relation 187204. Up to 10583 conditions per place. [2022-12-06 05:17:04,661 INFO L137 encePairwiseOnDemand]: 25/47 looper letters, 398 selfloop transitions, 237 changer transitions 13/648 dead transitions. [2022-12-06 05:17:04,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 648 transitions, 11290 flow [2022-12-06 05:17:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:17:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:17:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 272 transitions. [2022-12-06 05:17:04,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3617021276595745 [2022-12-06 05:17:04,662 INFO L175 Difference]: Start difference. First operand has 146 places, 312 transitions, 5999 flow. Second operand 16 states and 272 transitions. [2022-12-06 05:17:04,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 648 transitions, 11290 flow [2022-12-06 05:17:05,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 648 transitions, 11258 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 05:17:05,310 INFO L231 Difference]: Finished difference. Result has 170 places, 409 transitions, 9002 flow [2022-12-06 05:17:05,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5981, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9002, PETRI_PLACES=170, PETRI_TRANSITIONS=409} [2022-12-06 05:17:05,310 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2022-12-06 05:17:05,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:05,310 INFO L89 Accepts]: Start accepts. Operand has 170 places, 409 transitions, 9002 flow [2022-12-06 05:17:05,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:05,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:05,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 409 transitions, 9002 flow [2022-12-06 05:17:05,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 409 transitions, 9002 flow [2022-12-06 05:17:05,853 INFO L130 PetriNetUnfolder]: 1556/4213 cut-off events. [2022-12-06 05:17:05,854 INFO L131 PetriNetUnfolder]: For 60134/60780 co-relation queries the response was YES. [2022-12-06 05:17:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26431 conditions, 4213 events. 1556/4213 cut-off events. For 60134/60780 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 41123 event pairs, 168 based on Foata normal form. 170/4156 useless extension candidates. Maximal degree in co-relation 26233. Up to 926 conditions per place. [2022-12-06 05:17:05,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 409 transitions, 9002 flow [2022-12-06 05:17:05,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 2878 [2022-12-06 05:17:05,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:17:05,947 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:17:06,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [905] L50-1-->L49-6: Formula: (and (= (select (select |v_#memory_int_122| v_~get2~0.base_31) (+ (* v_thread1Thread1of1ForFork0_~i~0_50 4) v_~get2~0.offset_31)) |v_thread1Thread1of1ForFork0_#t~mem2_26|) (= v_thread1Thread1of1ForFork0_~i~0_49 (+ v_thread1Thread1of1ForFork0_~i~0_50 1))) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_26|, ~get2~0.offset=v_~get2~0.offset_31, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_50, #memory_int=|v_#memory_int_122|, ~get2~0.base=v_~get2~0.base_31} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_29|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, ~get2~0.offset=v_~get2~0.offset_31, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_49, #memory_int=|v_#memory_int_122|, ~get2~0.base=v_~get2~0.base_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:17:06,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 05:17:06,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 05:17:06,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [917] L50-3-->L51-1: Formula: (= (select (select |v_#memory_int_124| v_~get1~0.base_23) (+ v_~get1~0.offset_23 (* v_thread1Thread1of1ForFork0_~i~0_53 4))) |v_thread1Thread1of1ForFork0_#t~mem4_11|) InVars {#memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_29|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_11|, #memory_int=|v_#memory_int_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~get1~0.offset=v_~get1~0.offset_23, ~get1~0.base=v_~get1~0.base_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4] [2022-12-06 05:17:06,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:17:06,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:17:06,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:17:07,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:17:07,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 05:17:07,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:17:07,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1053] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (= v_~res1~0_62 (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_40| (select (select |v_#memory_int_298| v_~get2~0.base_87) (+ v_~get2~0.offset_87 (* v_thread1Thread1of1ForFork0_~i~0_83 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork0_~stop~0_43 1) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0)) InVars {thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_40|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, ~get2~0.base=v_~get2~0.base_87} OutVars{~res1~0=v_~res1~0_62, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_87, #memory_int=|v_#memory_int_298|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_83, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~get2~0.base=v_~get2~0.base_87, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_43} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:17:08,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [934] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_25 0) (= v_thread3Thread1of1ForFork2_~i~2_31 0) (= v_~count1~0_31 v_~count3~0_43)) InVars {~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_25, ~count3~0=v_~count3~0_43, ~count1~0=v_~count1~0_31, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:17:08,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1028] L70-1-->L69-6: Formula: (and (= (select (select |v_#memory_int_250| v_~get3~0.base_67) (+ v_~get3~0.offset_67 (* v_thread2Thread1of1ForFork1_~i~1_64 4))) |v_thread2Thread1of1ForFork1_#t~mem7_44|) (= v_thread2Thread1of1ForFork1_~i~1_63 (+ v_thread2Thread1of1ForFork1_~i~1_64 1))) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_44|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_64, ~get3~0.base=v_~get3~0.base_67, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_63, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_43|, ~get3~0.base=v_~get3~0.base_67, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_15|, #memory_int=|v_#memory_int_250|, ~get3~0.offset=v_~get3~0.offset_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~post6] [2022-12-06 05:17:08,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1060] L89-6-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork0_~stop~0_49 1) (let ((.cse0 (= |v_thread3Thread1of1ForFork2_#res.offset_23| 0)) (.cse1 (= (mod v_thread3Thread1of1ForFork2_~stop~2_57 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.base_23| 0))) (or (and .cse0 .cse1 (= (+ v_~res3~0_70 v_~n3~0_100) v_~n1~0_106) .cse2) (and .cse0 (not .cse1) (= v_~res3~0_72 v_~res3~0_70) .cse2))) (= |v_thread1Thread1of1ForFork0_#res.base_25| 0) (= (ite (< |v_thread1Thread1of1ForFork0_#t~mem4_50| (select (select |v_#memory_int_330| v_~get2~0.base_93) (+ v_~get2~0.offset_93 (* v_thread1Thread1of1ForFork0_~i~0_93 4)))) (- 1) 1) v_~res1~0_72) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n3~0_100)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_63 v_~n1~0_106))) (or (and (= v_thread3Thread1of1ForFork2_~stop~2_58 v_thread3Thread1of1ForFork2_~stop~2_57) (= |v_thread3Thread1of1ForFork2_#t~mem14_49| |v_thread3Thread1of1ForFork2_#t~mem14_50|) (= |v_thread3Thread1of1ForFork2_#t~mem15_45| |v_thread3Thread1of1ForFork2_#t~mem15_46|) (= |v_thread3Thread1of1ForFork2_#t~mem13_65| |v_thread3Thread1of1ForFork2_#t~mem13_66|) (= v_~res3~0_72 v_~res3~0_71) (= |v_thread3Thread1of1ForFork2_#t~mem12_64| |v_thread3Thread1of1ForFork2_#t~mem12_63|) (or (not .cse3) (not .cse4))) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_63 4))) (let ((.cse6 (select (select |v_#memory_int_330| v_~get3~0.base_93) (+ v_~get3~0.offset_93 .cse7))) (.cse5 (select (select |v_#memory_int_330| v_~get1~0.base_89) (+ v_~get1~0.offset_89 .cse7)))) (and (= (ite (< .cse5 .cse6) (- 1) 1) v_~res3~0_72) .cse4 .cse3 (= v_thread3Thread1of1ForFork2_~stop~2_57 1) (not (= .cse6 .cse5))))))) (= |v_thread1Thread1of1ForFork0_#res.offset_25| 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_66|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_64|, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, ~get3~0.offset=v_~get3~0.offset_93, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_46|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_50|, ~get1~0.base=v_~get1~0.base_89, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_58, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_50|, ~get2~0.offset=v_~get2~0.offset_93, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_71} OutVars{~res1~0=v_~res1~0_72, ~get3~0.base=v_~get3~0.base_93, ~n3~0=v_~n3~0_100, ~n1~0=v_~n1~0_106, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, ~get2~0.base=v_~get2~0.base_93, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_23|, ~get3~0.offset=v_~get3~0.offset_93, ~get1~0.base=v_~get1~0.base_89, thread1Thread1of1ForFork0_#t~mem5=|v_thread1Thread1of1ForFork0_#t~mem5_33|, ~get2~0.offset=v_~get2~0.offset_93, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_49, thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_65|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_63|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_25|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_23|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_25|, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_45|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_63, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_49|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_57, #memory_int=|v_#memory_int_330|, ~get1~0.offset=v_~get1~0.offset_89, ~res3~0=v_~res3~0_70} AuxVars[v_~res3~0_72] AssignedVars[~res1~0, thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread1Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~mem5, thread1Thread1of1ForFork0_~stop~0, ~res3~0] [2022-12-06 05:17:08,696 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:17:08,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0] [2022-12-06 05:17:09,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1012] L89-6-->L89-6: Formula: (and (< v_thread3Thread1of1ForFork2_~i~2_44 v_~n1~0_76) (let ((.cse0 (* v_thread3Thread1of1ForFork2_~i~2_44 4))) (= (select (select |v_#memory_int_220| v_~get3~0.base_51) (+ .cse0 v_~get3~0.offset_51)) (select (select |v_#memory_int_220| v_~get1~0.base_57) (+ .cse0 v_~get1~0.offset_57)))) (= v_thread3Thread1of1ForFork2_~i~2_43 (+ v_thread3Thread1of1ForFork2_~i~2_44 1)) (< v_thread3Thread1of1ForFork2_~i~2_44 v_~n3~0_66)) InVars {~get3~0.base=v_~get3~0.base_51, ~n3~0=v_~n3~0_66, ~n1~0=v_~n1~0_76, #memory_int=|v_#memory_int_220|, ~get3~0.offset=v_~get3~0.offset_51, ~get1~0.offset=v_~get1~0.offset_57, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_44, ~get1~0.base=v_~get1~0.base_57} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_37|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_35|, ~get3~0.base=v_~get3~0.base_51, ~n3~0=v_~n3~0_66, ~n1~0=v_~n1~0_76, #memory_int=|v_#memory_int_220|, thread3Thread1of1ForFork2_#t~post11=|v_thread3Thread1of1ForFork2_#t~post11_19|, ~get3~0.offset=v_~get3~0.offset_51, ~get1~0.offset=v_~get1~0.offset_57, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_43, ~get1~0.base=v_~get1~0.base_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#t~post11, thread3Thread1of1ForFork2_~i~2] [2022-12-06 05:17:09,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1058] L89-6-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_326| v_~get3~0.base_89))) (and (= v_thread2Thread1of1ForFork1_~stop~1_39 1) (= |v_thread2Thread1of1ForFork1_#res.base_19| 0) (let ((.cse2 (= (mod v_thread3Thread1of1ForFork2_~stop~2_49 256) 0)) (.cse0 (= |v_thread3Thread1of1ForFork2_#res.base_19| 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0))) (or (and .cse0 (= v_~res3~0_58 v_~res3~0_60) .cse1 (not .cse2)) (and (= v_~n1~0_102 (+ v_~n3~0_96 v_~res3~0_58)) .cse2 .cse0 .cse1))) (= (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_50| (select .cse3 (+ v_~get3~0.offset_89 (* v_thread2Thread1of1ForFork1_~i~1_87 4)))) (- 1) 1) v_~res2~0_66) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n1~0_102)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_59 v_~n3~0_96))) (or (let ((.cse8 (* v_thread3Thread1of1ForFork2_~i~2_59 4))) (let ((.cse7 (select .cse3 (+ v_~get3~0.offset_89 .cse8))) (.cse6 (select (select |v_#memory_int_326| v_~get1~0.base_85) (+ v_~get1~0.offset_85 .cse8)))) (and .cse4 .cse5 (= v_~res3~0_60 (ite (< .cse6 .cse7) (- 1) 1)) (not (= .cse7 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_49 1)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem12_56| |v_thread3Thread1of1ForFork2_#t~mem12_55|) (= v_~res3~0_59 v_~res3~0_60) (or (not .cse4) (not .cse5)) (= v_thread3Thread1of1ForFork2_~stop~2_49 v_thread3Thread1of1ForFork2_~stop~2_50) (= |v_thread3Thread1of1ForFork2_#t~mem14_42| |v_thread3Thread1of1ForFork2_#t~mem14_41|) (= |v_thread3Thread1of1ForFork2_#t~mem15_38| |v_thread3Thread1of1ForFork2_#t~mem15_37|) (= |v_thread3Thread1of1ForFork2_#t~mem13_58| |v_thread3Thread1of1ForFork2_#t~mem13_57|)))) (= |v_thread2Thread1of1ForFork1_#res.offset_19| 0))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_58|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_56|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_38|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_42|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_50, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_50|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res3~0=v_~res3~0_59} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_57|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_19|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_55|, ~get3~0.base=v_~get3~0.base_89, ~n3~0=v_~n3~0_96, ~n1~0=v_~n1~0_102, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~get3~0.offset=v_~get3~0.offset_89, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_37|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_59, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_41|, ~get1~0.base=v_~get1~0.base_85, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_49, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_39, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_19|, #memory_int=|v_#memory_int_326|, ~get1~0.offset=v_~get1~0.offset_85, ~res2~0=v_~res2~0_66, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_33|, ~res3~0=v_~res3~0_58} AuxVars[v_~res3~0_60] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread2Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10, ~res3~0] [2022-12-06 05:17:09,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1132] $Ultimate##0-->L51-1: Formula: (and (= 0 v_thread3Thread1of1ForFork2_~stop~2_155) (= v_~count1~0_173 v_~count3~0_179) (= (select (select |v_#memory_int_569| v_~get1~0.base_180) (+ v_~get1~0.offset_180 (* v_thread1Thread1of1ForFork0_~i~0_141 4))) |v_thread1Thread1of1ForFork0_#t~mem4_86|) (= v_thread3Thread1of1ForFork2_~i~2_129 0)) InVars {~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, ~get1~0.base=v_~get1~0.base_180} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_73|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_64|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_155, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_86|, ~count3~0=v_~count3~0_179, ~count1~0=v_~count1~0_173, #memory_int=|v_#memory_int_569|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, ~get1~0.offset=v_~get1~0.offset_180, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_129, ~get1~0.base=v_~get1~0.base_180} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread3Thread1of1ForFork2_~stop~2, thread1Thread1of1ForFork0_#t~mem4, thread3Thread1of1ForFork2_~i~2] and [1055] L71-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= v_thread2Thread1of1ForFork1_~stop~1_35 1) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= v_~res2~0_60 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_42| (select (select |v_#memory_int_304| v_~get3~0.base_81) (+ v_~get3~0.offset_81 (* v_thread2Thread1of1ForFork1_~i~1_83 4)))) (- 1) 1))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_42|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_83, ~get3~0.base=v_~get3~0.base_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_35, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_304|, ~get3~0.offset=v_~get3~0.offset_81, ~res2~0=v_~res2~0_60, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:17:09,422 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:17:09,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4113 [2022-12-06 05:17:09,423 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 408 transitions, 9444 flow [2022-12-06 05:17:09,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:09,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:09,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:09,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 05:17:09,424 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:17:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 423201592, now seen corresponding path program 1 times [2022-12-06 05:17:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:09,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049918135] [2022-12-06 05:17:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:10,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049918135] [2022-12-06 05:17:10,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049918135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:10,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:10,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 05:17:10,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549976152] [2022-12-06 05:17:10,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:10,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:17:10,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:10,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:17:10,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:17:10,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 05:17:10,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 408 transitions, 9444 flow. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:10,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:10,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 05:17:10,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:18,409 INFO L130 PetriNetUnfolder]: 35723/52093 cut-off events. [2022-12-06 05:17:18,409 INFO L131 PetriNetUnfolder]: For 590773/590773 co-relation queries the response was YES. [2022-12-06 05:17:18,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311143 conditions, 52093 events. 35723/52093 cut-off events. For 590773/590773 co-relation queries the response was YES. Maximal size of possible extension queue 1910. Compared 356617 event pairs, 14728 based on Foata normal form. 4/52095 useless extension candidates. Maximal degree in co-relation 310764. Up to 34112 conditions per place. [2022-12-06 05:17:18,975 INFO L137 encePairwiseOnDemand]: 56/78 looper letters, 763 selfloop transitions, 80 changer transitions 44/887 dead transitions. [2022-12-06 05:17:18,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 887 transitions, 17478 flow [2022-12-06 05:17:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:17:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:17:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 311 transitions. [2022-12-06 05:17:18,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23453996983408748 [2022-12-06 05:17:18,992 INFO L175 Difference]: Start difference. First operand has 167 places, 408 transitions, 9444 flow. Second operand 17 states and 311 transitions. [2022-12-06 05:17:18,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 887 transitions, 17478 flow [2022-12-06 05:17:23,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 887 transitions, 17011 flow, removed 127 selfloop flow, removed 8 redundant places. [2022-12-06 05:17:23,681 INFO L231 Difference]: Finished difference. Result has 190 places, 487 transitions, 10767 flow [2022-12-06 05:17:23,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=9119, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10767, PETRI_PLACES=190, PETRI_TRANSITIONS=487} [2022-12-06 05:17:23,682 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 152 predicate places. [2022-12-06 05:17:23,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:23,682 INFO L89 Accepts]: Start accepts. Operand has 190 places, 487 transitions, 10767 flow [2022-12-06 05:17:23,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:23,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:23,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 487 transitions, 10767 flow [2022-12-06 05:17:23,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 487 transitions, 10767 flow [2022-12-06 05:17:24,555 INFO L130 PetriNetUnfolder]: 2624/6900 cut-off events. [2022-12-06 05:17:24,555 INFO L131 PetriNetUnfolder]: For 107278/109077 co-relation queries the response was YES. [2022-12-06 05:17:24,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44592 conditions, 6900 events. 2624/6900 cut-off events. For 107278/109077 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 71828 event pairs, 309 based on Foata normal form. 248/6849 useless extension candidates. Maximal degree in co-relation 44204. Up to 1520 conditions per place. [2022-12-06 05:17:24,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 487 transitions, 10767 flow [2022-12-06 05:17:24,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 3766 [2022-12-06 05:17:32,833 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:17:32,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9152 [2022-12-06 05:17:32,834 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 487 transitions, 10812 flow [2022-12-06 05:17:32,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:32,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:32,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:32,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 05:17:32,835 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:17:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash 744151707, now seen corresponding path program 1 times [2022-12-06 05:17:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:32,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136422871] [2022-12-06 05:17:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:33,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136422871] [2022-12-06 05:17:33,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136422871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:33,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:33,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 05:17:33,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101155931] [2022-12-06 05:17:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:17:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:17:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:17:33,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-06 05:17:33,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 487 transitions, 10812 flow. Second operand has 11 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-06 05:17:33,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:33,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-06 05:17:33,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:43,725 INFO L130 PetriNetUnfolder]: 36615/53317 cut-off events. [2022-12-06 05:17:43,725 INFO L131 PetriNetUnfolder]: For 730202/730202 co-relation queries the response was YES. [2022-12-06 05:17:44,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345903 conditions, 53317 events. 36615/53317 cut-off events. For 730202/730202 co-relation queries the response was YES. Maximal size of possible extension queue 1999. Compared 362981 event pairs, 15716 based on Foata normal form. 2/53184 useless extension candidates. Maximal degree in co-relation 345394. Up to 21006 conditions per place. [2022-12-06 05:17:44,406 INFO L137 encePairwiseOnDemand]: 51/82 looper letters, 659 selfloop transitions, 150 changer transitions 14/823 dead transitions. [2022-12-06 05:17:44,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 823 transitions, 17995 flow [2022-12-06 05:17:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:17:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:17:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2022-12-06 05:17:44,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3231707317073171 [2022-12-06 05:17:44,416 INFO L175 Difference]: Start difference. First operand has 186 places, 487 transitions, 10812 flow. Second operand 8 states and 212 transitions. [2022-12-06 05:17:44,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 823 transitions, 17995 flow [2022-12-06 05:17:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 823 transitions, 17799 flow, removed 98 selfloop flow, removed 4 redundant places. [2022-12-06 05:17:51,035 INFO L231 Difference]: Finished difference. Result has 194 places, 544 transitions, 12600 flow [2022-12-06 05:17:51,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=10664, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12600, PETRI_PLACES=194, PETRI_TRANSITIONS=544} [2022-12-06 05:17:51,036 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 156 predicate places. [2022-12-06 05:17:51,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:51,036 INFO L89 Accepts]: Start accepts. Operand has 194 places, 544 transitions, 12600 flow [2022-12-06 05:17:51,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:51,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:51,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 544 transitions, 12600 flow [2022-12-06 05:17:51,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 544 transitions, 12600 flow [2022-12-06 05:17:52,005 INFO L130 PetriNetUnfolder]: 2881/7466 cut-off events. [2022-12-06 05:17:52,005 INFO L131 PetriNetUnfolder]: For 127924/129538 co-relation queries the response was YES. [2022-12-06 05:17:52,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50572 conditions, 7466 events. 2881/7466 cut-off events. For 127924/129538 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 77971 event pairs, 304 based on Foata normal form. 296/7490 useless extension candidates. Maximal degree in co-relation 50290. Up to 1673 conditions per place. [2022-12-06 05:17:52,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 544 transitions, 12600 flow [2022-12-06 05:17:52,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 4254 [2022-12-06 05:17:52,169 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:52,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1133 [2022-12-06 05:17:52,169 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 544 transitions, 12600 flow [2022-12-06 05:17:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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-06 05:17:52,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:52,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 05:17:52,170 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:17:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2025523196, now seen corresponding path program 1 times [2022-12-06 05:17:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:52,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349903171] [2022-12-06 05:17:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:53,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349903171] [2022-12-06 05:17:53,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349903171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:53,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:53,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 05:17:53,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969541828] [2022-12-06 05:17:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:53,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:17:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:53,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:17:53,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:17:53,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 05:17:53,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 544 transitions, 12600 flow. Second operand has 11 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-06 05:17:53,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:53,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 05:17:53,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:03,064 INFO L130 PetriNetUnfolder]: 36607/53304 cut-off events. [2022-12-06 05:18:03,064 INFO L131 PetriNetUnfolder]: For 783207/783207 co-relation queries the response was YES. [2022-12-06 05:18:03,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354794 conditions, 53304 events. 36607/53304 cut-off events. For 783207/783207 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 361133 event pairs, 10031 based on Foata normal form. 2/53172 useless extension candidates. Maximal degree in co-relation 354397. Up to 10583 conditions per place. [2022-12-06 05:18:03,887 INFO L137 encePairwiseOnDemand]: 29/81 looper letters, 499 selfloop transitions, 389 changer transitions 10/898 dead transitions. [2022-12-06 05:18:03,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 898 transitions, 19292 flow [2022-12-06 05:18:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:18:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:18:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 289 transitions. [2022-12-06 05:18:03,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29732510288065844 [2022-12-06 05:18:03,888 INFO L175 Difference]: Start difference. First operand has 191 places, 544 transitions, 12600 flow. Second operand 12 states and 289 transitions. [2022-12-06 05:18:03,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 898 transitions, 19292 flow [2022-12-06 05:18:10,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 898 transitions, 19204 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-06 05:18:10,330 INFO L231 Difference]: Finished difference. Result has 199 places, 616 transitions, 15103 flow [2022-12-06 05:18:10,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=12544, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15103, PETRI_PLACES=199, PETRI_TRANSITIONS=616} [2022-12-06 05:18:10,330 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2022-12-06 05:18:10,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:10,331 INFO L89 Accepts]: Start accepts. Operand has 199 places, 616 transitions, 15103 flow [2022-12-06 05:18:10,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:10,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:10,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 616 transitions, 15103 flow [2022-12-06 05:18:10,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 616 transitions, 15103 flow [2022-12-06 05:18:11,275 INFO L130 PetriNetUnfolder]: 2955/7558 cut-off events. [2022-12-06 05:18:11,275 INFO L131 PetriNetUnfolder]: For 142475/144138 co-relation queries the response was YES. [2022-12-06 05:18:11,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53239 conditions, 7558 events. 2955/7558 cut-off events. For 142475/144138 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 78126 event pairs, 340 based on Foata normal form. 343/7634 useless extension candidates. Maximal degree in co-relation 53154. Up to 1706 conditions per place. [2022-12-06 05:18:11,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 616 transitions, 15103 flow [2022-12-06 05:18:11,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 4690 [2022-12-06 05:18:11,533 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:11,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1203 [2022-12-06 05:18:11,534 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 616 transitions, 15103 flow [2022-12-06 05:18:11,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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-06 05:18:11,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:11,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:11,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 05:18:11,534 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:18:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1798877282, now seen corresponding path program 1 times [2022-12-06 05:18:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:11,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003951570] [2022-12-06 05:18:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:12,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003951570] [2022-12-06 05:18:12,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003951570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:12,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:12,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 05:18:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849321769] [2022-12-06 05:18:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:12,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:18:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:12,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:18:12,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:18:12,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 05:18:12,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 616 transitions, 15103 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-06 05:18:12,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:12,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 05:18:12,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand