/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:11:41,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:11:41,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:11:41,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:11:41,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:11:41,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:11:41,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:11:41,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:11:41,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:11:41,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:11:41,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:11:41,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:11:41,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:11:41,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:11:41,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:11:41,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:11:41,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:11:41,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:11:41,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:11:41,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:11:41,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:11:41,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:11:41,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:11:41,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:11:41,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:11:41,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:11:41,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:11:41,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:11:41,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:11:41,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:11:41,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:11:41,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:11:41,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:11:41,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:11:41,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:11:41,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:11:41,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:11:41,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:11:41,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:11:41,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:11:41,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:11:41,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:11:41,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:11:41,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:11:41,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:11:41,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:11:41,577 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:11:41,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:11:41,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:11:41,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:11:41,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:11:41,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:11:41,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:11:41,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:11:41,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:11:41,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:11:41,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:11:41,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:11:41,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:11:41,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:11:41,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:11:41,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:11:41,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:11:41,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:11:41,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:11:41,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:11:41,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:11:41,860 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:11:41,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-12-06 07:11:42,890 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:11:43,085 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:11:43,085 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-12-06 07:11:43,090 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecb63b8f/f3885406c9084dd0ab71bb6cc9e63b4c/FLAG77aa89a0d [2022-12-06 07:11:43,100 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecb63b8f/f3885406c9084dd0ab71bb6cc9e63b4c [2022-12-06 07:11:43,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:11:43,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:11:43,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:11:43,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:11:43,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:11:43,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c73ecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43, skipping insertion in model container [2022-12-06 07:11:43,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:11:43,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:11:43,238 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/bench-exp3x3.wvr.c[2625,2638] [2022-12-06 07:11:43,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:11:43,250 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:11:43,268 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/bench-exp3x3.wvr.c[2625,2638] [2022-12-06 07:11:43,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:11:43,279 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:11:43,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43 WrapperNode [2022-12-06 07:11:43,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:11:43,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:11:43,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:11:43,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:11:43,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,326 INFO L138 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-12-06 07:11:43,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:11:43,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:11:43,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:11:43,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:11:43,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,344 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:11:43,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:11:43,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:11:43,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:11:43,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (1/1) ... [2022-12-06 07:11:43,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:11:43,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:43,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:11:43,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:11:43,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:11:43,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:11:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:11:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:11:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:11:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:11:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:11:43,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:11:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:11:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:11:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 07:11:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 07:11:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 07:11:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 07:11:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:11:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:11:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:11:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:11:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:11:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:11:43,426 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:11:43,559 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:11:43,561 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:11:43,768 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:11:43,774 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:11:43,774 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:11:43,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:11:43 BoogieIcfgContainer [2022-12-06 07:11:43,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:11:43,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:11:43,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:11:43,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:11:43,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:11:43" (1/3) ... [2022-12-06 07:11:43,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfc756c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:11:43, skipping insertion in model container [2022-12-06 07:11:43,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:43" (2/3) ... [2022-12-06 07:11:43,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfc756c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:11:43, skipping insertion in model container [2022-12-06 07:11:43,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:11:43" (3/3) ... [2022-12-06 07:11:43,782 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2022-12-06 07:11:43,798 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:11:43,798 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:11:43,798 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:11:43,897 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-06 07:11:43,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 07:11:44,019 INFO L130 PetriNetUnfolder]: 14/156 cut-off events. [2022-12-06 07:11:44,019 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:11:44,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 156 events. 14/156 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 07:11:44,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 07:11:44,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:44,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:44,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:44,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:44,084 INFO L130 PetriNetUnfolder]: 14/140 cut-off events. [2022-12-06 07:11:44,084 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:11:44,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 140 events. 14/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 07:11:44,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:44,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 2916 [2022-12-06 07:11:48,975 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 07:11:49,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:11:49,004 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;@58a9ee13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:11:49,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 07:11:49,009 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 07:11:49,009 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:11:49,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:49,010 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, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:49,010 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 4 more)] === [2022-12-06 07:11:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash -54134606, now seen corresponding path program 1 times [2022-12-06 07:11:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:49,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201670066] [2022-12-06 07:11:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:49,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 07:11:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:49,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201670066] [2022-12-06 07:11:49,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201670066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:49,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:49,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:11:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701157338] [2022-12-06 07:11:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:49,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:11:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:11:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:11:49,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:49,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 110 flow. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 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 07:11:49,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:49,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:49,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:50,072 INFO L130 PetriNetUnfolder]: 3473/4229 cut-off events. [2022-12-06 07:11:50,073 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-12-06 07:11:50,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 4229 events. 3473/4229 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11636 event pairs, 837 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 6136. Up to 3015 conditions per place. [2022-12-06 07:11:50,098 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 63 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2022-12-06 07:11:50,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 353 flow [2022-12-06 07:11:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:11:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:11:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 07:11:50,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-06 07:11:50,108 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 72 transitions. [2022-12-06 07:11:50,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 353 flow [2022-12-06 07:11:50,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 307 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 07:11:50,119 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 133 flow [2022-12-06 07:11:50,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2022-12-06 07:11:50,127 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2022-12-06 07:11:50,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:50,128 INFO L89 Accepts]: Start accepts. Operand has 41 places, 43 transitions, 133 flow [2022-12-06 07:11:50,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:50,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:50,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 43 transitions, 133 flow [2022-12-06 07:11:50,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 133 flow [2022-12-06 07:11:50,144 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0][20], [40#L38-1true, 170#true, 67#L54-1true, 46#L103-4true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,145 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:11:50,145 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:11:50,145 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:11:50,145 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:11:50,145 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][24], [40#L38-1true, 170#true, 20#L104-4true, 61#L70-1true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,145 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,146 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,146 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,146 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,146 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][24], [40#L38-1true, 170#true, 20#L104-4true, 61#L70-1true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,147 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,147 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,147 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,147 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,147 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,148 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][28], [40#L38-1true, 170#true, 114#L78-1true, 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,148 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,148 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,149 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,151 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,156 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][28], [40#L38-1true, 170#true, 114#L78-1true, 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,156 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,156 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,156 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,156 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,157 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,157 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][28], [40#L38-1true, 114#L78-1true, 170#true, 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,157 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,157 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,157 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,157 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,157 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,157 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,160 INFO L130 PetriNetUnfolder]: 41/95 cut-off events. [2022-12-06 07:11:50,161 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:11:50,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 95 events. 41/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 131 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 102. Up to 44 conditions per place. [2022-12-06 07:11:50,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 43 transitions, 133 flow [2022-12-06 07:11:50,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 07:11:50,164 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:50,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 07:11:50,166 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 133 flow [2022-12-06 07:11:50,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 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 07:11:50,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:50,166 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:50,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:11:50,169 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 4 more)] === [2022-12-06 07:11:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash -685639153, now seen corresponding path program 1 times [2022-12-06 07:11:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:50,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382126684] [2022-12-06 07:11:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:50,407 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 07:11:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382126684] [2022-12-06 07:11:50,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382126684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:50,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:50,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134434893] [2022-12-06 07:11:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:50,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:50,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:50,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:50,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:50,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:50,843 INFO L130 PetriNetUnfolder]: 5067/6189 cut-off events. [2022-12-06 07:11:50,843 INFO L131 PetriNetUnfolder]: For 2240/2240 co-relation queries the response was YES. [2022-12-06 07:11:50,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15972 conditions, 6189 events. 5067/6189 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19168 event pairs, 259 based on Foata normal form. 122/6311 useless extension candidates. Maximal degree in co-relation 4985. Up to 3157 conditions per place. [2022-12-06 07:11:50,868 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 116 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2022-12-06 07:11:50,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 126 transitions, 621 flow [2022-12-06 07:11:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-06 07:11:50,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2022-12-06 07:11:50,870 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 133 flow. Second operand 5 states and 116 transitions. [2022-12-06 07:11:50,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 126 transitions, 621 flow [2022-12-06 07:11:50,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 126 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:11:50,872 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 191 flow [2022-12-06 07:11:50,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2022-12-06 07:11:50,873 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2022-12-06 07:11:50,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:50,873 INFO L89 Accepts]: Start accepts. Operand has 46 places, 50 transitions, 191 flow [2022-12-06 07:11:50,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:50,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:50,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 50 transitions, 191 flow [2022-12-06 07:11:50,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 50 transitions, 191 flow [2022-12-06 07:11:50,877 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0][27], [40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 46#L103-4true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 92#L46-1true]) [2022-12-06 07:11:50,878 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:11:50,878 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:11:50,878 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:11:50,878 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:11:50,879 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][32], [40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 92#L46-1true]) [2022-12-06 07:11:50,879 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2022-12-06 07:11:50,879 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:11:50,879 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:11:50,879 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:11:50,880 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][32], [40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 92#L46-1true]) [2022-12-06 07:11:50,880 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:11:50,880 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:50,880 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:50,880 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,880 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:50,880 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 92#L46-1true]) [2022-12-06 07:11:50,881 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,881 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,881 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,881 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,881 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][32], [177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 20#L104-4true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true, 94#thread1EXITtrue]) [2022-12-06 07:11:50,881 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,881 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,881 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,881 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:50,882 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,882 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,882 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,882 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,882 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,883 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,883 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 07:11:50,883 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:50,883 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2022-12-06 07:11:50,883 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:50,883 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:50,883 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:50,883 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,883 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,883 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,883 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:50,884 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,884 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,884 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true, 94#thread1EXITtrue]) [2022-12-06 07:11:50,884 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2022-12-06 07:11:50,884 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 07:11:50,884 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 07:11:50,884 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 07:11:50,884 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true, 94#thread1EXITtrue]) [2022-12-06 07:11:50,884 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 07:11:50,884 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:50,885 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:50,885 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:50,885 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:50,885 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][37], [40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 63#L105-4true, 67#L54-1true, 43#thread2EXITtrue, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true]) [2022-12-06 07:11:50,885 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 07:11:50,886 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:50,886 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:50,886 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:50,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] thread1EXIT-->L106-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][38], [65#L106-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 43#thread2EXITtrue, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-12-06 07:11:50,886 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:11:50,886 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:11:50,886 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:11:50,887 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:11:50,890 INFO L130 PetriNetUnfolder]: 117/208 cut-off events. [2022-12-06 07:11:50,890 INFO L131 PetriNetUnfolder]: For 80/119 co-relation queries the response was YES. [2022-12-06 07:11:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 208 events. 117/208 cut-off events. For 80/119 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 459 event pairs, 0 based on Foata normal form. 10/175 useless extension candidates. Maximal degree in co-relation 368. Up to 124 conditions per place. [2022-12-06 07:11:50,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 50 transitions, 191 flow [2022-12-06 07:11:50,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 758 [2022-12-06 07:11:50,893 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:50,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 07:11:50,893 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 191 flow [2022-12-06 07:11:50,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:50,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:50,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:11:50,894 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 4 more)] === [2022-12-06 07:11:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1491440014, now seen corresponding path program 1 times [2022-12-06 07:11:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:50,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372396605] [2022-12-06 07:11:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:51,065 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 07:11:51,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:51,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372396605] [2022-12-06 07:11:51,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372396605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:51,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:51,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629575334] [2022-12-06 07:11:51,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:51,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:51,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:51,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:51,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:51,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:51,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:51,482 INFO L130 PetriNetUnfolder]: 4881/6003 cut-off events. [2022-12-06 07:11:51,482 INFO L131 PetriNetUnfolder]: For 4584/4584 co-relation queries the response was YES. [2022-12-06 07:11:51,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16717 conditions, 6003 events. 4881/6003 cut-off events. For 4584/4584 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18795 event pairs, 259 based on Foata normal form. 186/6189 useless extension candidates. Maximal degree in co-relation 7058. Up to 3157 conditions per place. [2022-12-06 07:11:51,510 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 116 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2022-12-06 07:11:51,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 642 flow [2022-12-06 07:11:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-06 07:11:51,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 07:11:51,511 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 191 flow. Second operand 5 states and 115 transitions. [2022-12-06 07:11:51,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 642 flow [2022-12-06 07:11:51,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:11:51,517 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 205 flow [2022-12-06 07:11:51,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-06 07:11:51,518 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2022-12-06 07:11:51,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:51,518 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 205 flow [2022-12-06 07:11:51,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:51,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:51,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 205 flow [2022-12-06 07:11:51,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 205 flow [2022-12-06 07:11:51,522 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0][26], [182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 46#L103-4true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:51,522 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:11:51,522 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:11:51,522 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:11:51,522 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:11:51,523 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][31], [182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 92#L46-1true]) [2022-12-06 07:11:51,523 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is not cut-off event [2022-12-06 07:11:51,523 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:11:51,523 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 07:11:51,523 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 07:11:51,524 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][31], [182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 20#L104-4true, 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:51,524 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:11:51,524 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:51,524 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:51,524 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:51,524 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:51,524 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [182#true, 40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 63#L105-4true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:51,525 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:11:51,525 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:51,525 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:51,525 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:51,525 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, 67#L54-1true, 63#L105-4true, 82#L62-1true, 184#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 182#true, 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:51,525 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:51,525 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:51,525 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:51,525 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:51,526 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [182#true, 40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 63#L105-4true, 82#L62-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 92#L46-1true]) [2022-12-06 07:11:51,526 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 07:11:51,526 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:51,526 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:51,526 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2022-12-06 07:11:51,526 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:51,527 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [182#true, 40#L38-1true, 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 63#L105-4true, 82#L62-1true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 92#L46-1true]) [2022-12-06 07:11:51,527 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:11:51,527 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:51,527 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:51,527 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:51,527 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:51,527 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:51,528 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][36], [114#L78-1true, 63#L105-4true, 43#thread2EXITtrue, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 40#L38-1true, 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, 82#L62-1true, Black: 182#true]) [2022-12-06 07:11:51,528 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 07:11:51,528 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:51,528 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:51,528 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:51,528 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] thread1EXIT-->L106-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][37], [65#L106-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 114#L78-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 43#thread2EXITtrue, 82#L62-1true, Black: 182#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-12-06 07:11:51,528 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:11:51,528 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:11:51,529 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:11:51,529 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:11:51,532 INFO L130 PetriNetUnfolder]: 91/173 cut-off events. [2022-12-06 07:11:51,532 INFO L131 PetriNetUnfolder]: For 119/159 co-relation queries the response was YES. [2022-12-06 07:11:51,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 173 events. 91/173 cut-off events. For 119/159 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 349 event pairs, 0 based on Foata normal form. 9/147 useless extension candidates. Maximal degree in co-relation 299. Up to 94 conditions per place. [2022-12-06 07:11:51,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 205 flow [2022-12-06 07:11:51,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-06 07:11:51,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:51,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:11:51,535 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 205 flow [2022-12-06 07:11:51,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:51,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:51,535 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:11:51,536 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 4 more)] === [2022-12-06 07:11:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1579273175, now seen corresponding path program 2 times [2022-12-06 07:11:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:51,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157123190] [2022-12-06 07:11:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:51,664 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 07:11:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157123190] [2022-12-06 07:11:51,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157123190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:51,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250217018] [2022-12-06 07:11:51,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:11:51,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:51,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:51,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:11:51,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:11:51,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:11:51,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:11:51,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:51,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:52,153 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 07:11:52,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:11:52,212 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 07:11:52,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250217018] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:11:52,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:11:52,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:11:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303159610] [2022-12-06 07:11:52,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:11:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:11:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:11:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:11:52,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:52,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:52,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:52,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:52,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:52,701 INFO L130 PetriNetUnfolder]: 5649/6927 cut-off events. [2022-12-06 07:11:52,701 INFO L131 PetriNetUnfolder]: For 8469/8469 co-relation queries the response was YES. [2022-12-06 07:11:52,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20564 conditions, 6927 events. 5649/6927 cut-off events. For 8469/8469 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21270 event pairs, 1803 based on Foata normal form. 156/7083 useless extension candidates. Maximal degree in co-relation 9382. Up to 3643 conditions per place. [2022-12-06 07:11:52,731 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 114 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2022-12-06 07:11:52,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 662 flow [2022-12-06 07:11:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-06 07:11:52,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2022-12-06 07:11:52,733 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 205 flow. Second operand 5 states and 116 transitions. [2022-12-06 07:11:52,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 662 flow [2022-12-06 07:11:52,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:11:52,737 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 248 flow [2022-12-06 07:11:52,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-06 07:11:52,738 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2022-12-06 07:11:52,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:52,738 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 248 flow [2022-12-06 07:11:52,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:52,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:52,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 248 flow [2022-12-06 07:11:52,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 248 flow [2022-12-06 07:11:52,744 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][34], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 20#L104-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true]) [2022-12-06 07:11:52,744 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:11:52,744 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:52,744 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:52,744 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:52,745 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0][34], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 20#L104-4true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,745 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 07:11:52,745 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:52,745 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 07:11:52,745 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 07:11:52,746 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, 67#L54-1true, Black: 182#true, 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 82#L62-1true, 196#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,746 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:52,746 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:52,746 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:52,746 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:52,747 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true]) [2022-12-06 07:11:52,747 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 07:11:52,747 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:52,747 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:52,747 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:52,748 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true]) [2022-12-06 07:11:52,748 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,748 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:52,748 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,748 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,748 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,748 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 174#true, 182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,749 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2022-12-06 07:11:52,749 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:52,749 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:52,749 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 07:11:52,749 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, 63#L105-4true, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 182#true, 40#L38-1true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,749 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,749 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:52,749 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,749 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,749 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:52,750 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, 63#L105-4true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 94#thread1EXITtrue, 182#true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, 82#L62-1true, 92#L46-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,750 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,750 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,750 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,750 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,750 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0][39], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, 63#L105-4true, 43#thread2EXITtrue, 174#true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 40#L38-1true, 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 67#L54-1true, Black: 182#true, 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,751 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,751 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,751 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,751 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 07:11:52,751 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] thread2EXIT-->L107-2: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork4_thidvar2_4 0) (= v_thread2Thread1of1ForFork4_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} AuxVars[] AssignedVars[][42], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 81#L107-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, Black: 182#true, 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,751 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:11:52,752 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:11:52,752 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:11:52,752 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:11:52,752 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] thread2EXIT-->L107-2: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork4_thidvar2_4 0) (= v_thread2Thread1of1ForFork4_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_4, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_4, thread2Thread1of1ForFork4_thidvar2=v_thread2Thread1of1ForFork4_thidvar2_4} AuxVars[] AssignedVars[][42], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 189#true, 114#L78-1true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 81#L107-2true, 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 67#L54-1true, Black: 182#true, 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:52,752 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:11:52,752 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:11:52,752 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:11:52,752 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:11:52,752 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:11:52,755 INFO L130 PetriNetUnfolder]: 135/230 cut-off events. [2022-12-06 07:11:52,755 INFO L131 PetriNetUnfolder]: For 240/280 co-relation queries the response was YES. [2022-12-06 07:11:52,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 230 events. 135/230 cut-off events. For 240/280 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 505 event pairs, 1 based on Foata normal form. 6/191 useless extension candidates. Maximal degree in co-relation 512. Up to 143 conditions per place. [2022-12-06 07:11:52,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 52 transitions, 248 flow [2022-12-06 07:11:52,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 07:11:52,759 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:52,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 07:11:52,759 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 248 flow [2022-12-06 07:11:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:52,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:52,760 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:52,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:11:52,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:52,980 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 4 more)] === [2022-12-06 07:11:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 873411309, now seen corresponding path program 1 times [2022-12-06 07:11:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:52,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309305245] [2022-12-06 07:11:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:52,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:53,090 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 07:11:53,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:53,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309305245] [2022-12-06 07:11:53,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309305245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:53,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635707895] [2022-12-06 07:11:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:53,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:53,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:53,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:11:53,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:11:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:53,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:53,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:53,247 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 07:11:53,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:11:53,280 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 07:11:53,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635707895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:11:53,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:11:53,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:11:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088516879] [2022-12-06 07:11:53,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:11:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:11:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:53,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:11:53,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:11:53,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:53,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:53,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:53,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:53,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:54,252 INFO L130 PetriNetUnfolder]: 13057/16015 cut-off events. [2022-12-06 07:11:54,252 INFO L131 PetriNetUnfolder]: For 28062/28062 co-relation queries the response was YES. [2022-12-06 07:11:54,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51297 conditions, 16015 events. 13057/16015 cut-off events. For 28062/28062 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 57652 event pairs, 2873 based on Foata normal form. 408/16423 useless extension candidates. Maximal degree in co-relation 34546. Up to 6947 conditions per place. [2022-12-06 07:11:54,328 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 150 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2022-12-06 07:11:54,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 158 transitions, 1082 flow [2022-12-06 07:11:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-06 07:11:54,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2022-12-06 07:11:54,331 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 248 flow. Second operand 5 states and 118 transitions. [2022-12-06 07:11:54,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 158 transitions, 1082 flow [2022-12-06 07:11:54,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 158 transitions, 1055 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 07:11:54,346 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 294 flow [2022-12-06 07:11:54,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-12-06 07:11:54,347 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2022-12-06 07:11:54,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:54,348 INFO L89 Accepts]: Start accepts. Operand has 62 places, 57 transitions, 294 flow [2022-12-06 07:11:54,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:54,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:54,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 57 transitions, 294 flow [2022-12-06 07:11:54,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 57 transitions, 294 flow [2022-12-06 07:11:54,380 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][49], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 82#L62-1true, Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:54,381 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 07:11:54,381 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:54,381 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:54,381 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:54,381 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][49], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, 2#thread4EXITtrue, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:54,382 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-06 07:11:54,382 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:54,382 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:54,382 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:54,382 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][49], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 2#thread4EXITtrue, 385#true, 107#L108-2true, Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, Black: 182#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:54,382 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-06 07:11:54,382 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:54,382 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:54,382 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:54,388 INFO L130 PetriNetUnfolder]: 418/658 cut-off events. [2022-12-06 07:11:54,388 INFO L131 PetriNetUnfolder]: For 765/932 co-relation queries the response was YES. [2022-12-06 07:11:54,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 658 events. 418/658 cut-off events. For 765/932 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2306 event pairs, 65 based on Foata normal form. 16/570 useless extension candidates. Maximal degree in co-relation 1810. Up to 445 conditions per place. [2022-12-06 07:11:54,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 57 transitions, 294 flow [2022-12-06 07:11:54,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 1038 [2022-12-06 07:11:54,400 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:54,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 07:11:54,401 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 294 flow [2022-12-06 07:11:54,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:54,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:54,401 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:54,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:11:54,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:54,607 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 4 more)] === [2022-12-06 07:11:54,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1274253357, now seen corresponding path program 2 times [2022-12-06 07:11:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:54,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91891067] [2022-12-06 07:11:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:54,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:54,750 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 07:11:54,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:54,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91891067] [2022-12-06 07:11:54,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91891067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:54,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:54,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:54,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057916523] [2022-12-06 07:11:54,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:54,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:54,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:54,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:54,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:54,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:54,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:54,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:54,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:54,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:55,609 INFO L130 PetriNetUnfolder]: 11213/13735 cut-off events. [2022-12-06 07:11:55,609 INFO L131 PetriNetUnfolder]: For 26978/26978 co-relation queries the response was YES. [2022-12-06 07:11:55,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50231 conditions, 13735 events. 11213/13735 cut-off events. For 26978/26978 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49331 event pairs, 471 based on Foata normal form. 268/14003 useless extension candidates. Maximal degree in co-relation 34555. Up to 5849 conditions per place. [2022-12-06 07:11:55,768 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 150 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2022-12-06 07:11:55,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 161 transitions, 1148 flow [2022-12-06 07:11:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 07:11:55,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2022-12-06 07:11:55,770 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 294 flow. Second operand 5 states and 112 transitions. [2022-12-06 07:11:55,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 161 transitions, 1148 flow [2022-12-06 07:11:55,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 161 transitions, 1148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:11:55,814 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 355 flow [2022-12-06 07:11:55,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2022-12-06 07:11:55,815 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2022-12-06 07:11:55,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:55,815 INFO L89 Accepts]: Start accepts. Operand has 67 places, 62 transitions, 355 flow [2022-12-06 07:11:55,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:55,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:55,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 62 transitions, 355 flow [2022-12-06 07:11:55,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 355 flow [2022-12-06 07:11:55,837 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][54], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 385#true, 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), 82#L62-1true, Black: 182#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:55,837 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 07:11:55,837 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:55,837 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:55,837 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:55,838 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][54], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 61#L70-1true, 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 82#L62-1true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:55,838 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 07:11:55,838 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:55,838 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:55,838 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:55,841 INFO L130 PetriNetUnfolder]: 293/479 cut-off events. [2022-12-06 07:11:55,841 INFO L131 PetriNetUnfolder]: For 699/851 co-relation queries the response was YES. [2022-12-06 07:11:55,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 479 events. 293/479 cut-off events. For 699/851 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1588 event pairs, 36 based on Foata normal form. 12/432 useless extension candidates. Maximal degree in co-relation 1445. Up to 311 conditions per place. [2022-12-06 07:11:55,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 355 flow [2022-12-06 07:11:55,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-06 07:11:55,850 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:55,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 07:11:55,851 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 355 flow [2022-12-06 07:11:55,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:55,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:55,851 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:55,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:11:55,851 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 4 more)] === [2022-12-06 07:11:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash -427571439, now seen corresponding path program 1 times [2022-12-06 07:11:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:55,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815345559] [2022-12-06 07:11:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:55,983 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 07:11:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:55,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815345559] [2022-12-06 07:11:55,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815345559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:55,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:55,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818863578] [2022-12-06 07:11:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:55,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:55,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:55,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:55,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:55,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:55,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:56,914 INFO L130 PetriNetUnfolder]: 10921/13443 cut-off events. [2022-12-06 07:11:56,914 INFO L131 PetriNetUnfolder]: For 31534/31534 co-relation queries the response was YES. [2022-12-06 07:11:56,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52574 conditions, 13443 events. 10921/13443 cut-off events. For 31534/31534 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49085 event pairs, 471 based on Foata normal form. 292/13735 useless extension candidates. Maximal degree in co-relation 36230. Up to 5557 conditions per place. [2022-12-06 07:11:56,974 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 151 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2022-12-06 07:11:56,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 159 transitions, 1161 flow [2022-12-06 07:11:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 07:11:56,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 07:11:56,975 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 355 flow. Second operand 5 states and 111 transitions. [2022-12-06 07:11:56,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 159 transitions, 1161 flow [2022-12-06 07:11:57,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1150 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:11:57,030 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 358 flow [2022-12-06 07:11:57,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2022-12-06 07:11:57,031 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2022-12-06 07:11:57,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:57,031 INFO L89 Accepts]: Start accepts. Operand has 71 places, 61 transitions, 358 flow [2022-12-06 07:11:57,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:57,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:57,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 61 transitions, 358 flow [2022-12-06 07:11:57,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 358 flow [2022-12-06 07:11:57,054 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][53], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, 189#true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), 82#L62-1true, Black: 182#true, 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 589#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:57,054 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 07:11:57,054 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:57,054 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:57,054 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:57,054 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][53], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), 114#L78-1true, Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 189#true, Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 385#true, 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 182#true, 82#L62-1true, 589#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:57,054 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-06 07:11:57,054 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:57,054 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:57,054 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:11:57,055 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L108-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][53], [Black: 382#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296))), Black: 417#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 114#L78-1true, 189#true, 592#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 578#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 2#thread4EXITtrue, Black: 392#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296))), 385#true, 107#L108-2true, Black: 584#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 172#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 177#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 589#true, Black: 179#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 185#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 61#L70-1true, Black: 176#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 585#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 182#true, Black: 248#(and (<= (+ (mod ~x2~0 4294967296) (* (div (- (mod ~x2~0 4294967296)) 4294967296) 4294967296) 1) 0) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)))]) [2022-12-06 07:11:57,055 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-06 07:11:57,055 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:57,055 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:57,055 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-12-06 07:11:57,058 INFO L130 PetriNetUnfolder]: 283/473 cut-off events. [2022-12-06 07:11:57,058 INFO L131 PetriNetUnfolder]: For 761/915 co-relation queries the response was YES. [2022-12-06 07:11:57,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 473 events. 283/473 cut-off events. For 761/915 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1581 event pairs, 36 based on Foata normal form. 13/424 useless extension candidates. Maximal degree in co-relation 1458. Up to 298 conditions per place. [2022-12-06 07:11:57,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 61 transitions, 358 flow [2022-12-06 07:11:57,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-06 07:11:57,068 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:57,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 07:11:57,068 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 358 flow [2022-12-06 07:11:57,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:57,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:57,068 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:57,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:11:57,069 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 4 more)] === [2022-12-06 07:11:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -614309630, now seen corresponding path program 1 times [2022-12-06 07:11:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:57,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575813324] [2022-12-06 07:11:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:57,263 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 07:11:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:57,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575813324] [2022-12-06 07:11:57,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575813324] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:57,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414957785] [2022-12-06 07:11:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:57,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:57,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:11:57,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:11:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:57,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:57,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:11:57,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:11:57,495 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 07:11:57,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414957785] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:11:57,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:11:57,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:11:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525499605] [2022-12-06 07:11:57,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:11:57,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:11:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:57,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:11:57,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:11:57,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:57,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:57,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:57,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:57,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:59,139 INFO L130 PetriNetUnfolder]: 24421/30017 cut-off events. [2022-12-06 07:11:59,139 INFO L131 PetriNetUnfolder]: For 90165/90165 co-relation queries the response was YES. [2022-12-06 07:11:59,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120109 conditions, 30017 events. 24421/30017 cut-off events. For 90165/90165 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 118167 event pairs, 4823 based on Foata normal form. 744/30761 useless extension candidates. Maximal degree in co-relation 77250. Up to 13194 conditions per place. [2022-12-06 07:11:59,306 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 178 selfloop transitions, 8 changer transitions 0/186 dead transitions. [2022-12-06 07:11:59,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 186 transitions, 1492 flow [2022-12-06 07:11:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-06 07:11:59,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2022-12-06 07:11:59,308 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 358 flow. Second operand 5 states and 110 transitions. [2022-12-06 07:11:59,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 186 transitions, 1492 flow [2022-12-06 07:11:59,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 186 transitions, 1457 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 07:11:59,338 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 402 flow [2022-12-06 07:11:59,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2022-12-06 07:11:59,339 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2022-12-06 07:11:59,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:59,339 INFO L89 Accepts]: Start accepts. Operand has 77 places, 66 transitions, 402 flow [2022-12-06 07:11:59,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:59,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:59,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 66 transitions, 402 flow [2022-12-06 07:11:59,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 402 flow [2022-12-06 07:11:59,390 INFO L130 PetriNetUnfolder]: 477/860 cut-off events. [2022-12-06 07:11:59,390 INFO L131 PetriNetUnfolder]: For 1239/1557 co-relation queries the response was YES. [2022-12-06 07:11:59,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 860 events. 477/860 cut-off events. For 1239/1557 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3872 event pairs, 77 based on Foata normal form. 21/761 useless extension candidates. Maximal degree in co-relation 2690. Up to 504 conditions per place. [2022-12-06 07:11:59,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 66 transitions, 402 flow [2022-12-06 07:11:59,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 1522 [2022-12-06 07:11:59,407 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:59,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 07:11:59,408 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 402 flow [2022-12-06 07:11:59,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:59,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:59,408 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:11:59,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:11:59,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:59,613 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 4 more)] === [2022-12-06 07:11:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1599300327, now seen corresponding path program 1 times [2022-12-06 07:11:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:59,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949740322] [2022-12-06 07:11:59,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:59,783 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 07:11:59,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:59,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949740322] [2022-12-06 07:11:59,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949740322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:59,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:59,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556483112] [2022-12-06 07:11:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:59,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:59,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:59,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:59,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:11:59,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:59,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:59,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:01,643 INFO L130 PetriNetUnfolder]: 24045/29641 cut-off events. [2022-12-06 07:12:01,643 INFO L131 PetriNetUnfolder]: For 88745/88745 co-relation queries the response was YES. [2022-12-06 07:12:01,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130397 conditions, 29641 events. 24045/29641 cut-off events. For 88745/88745 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 119375 event pairs, 1383 based on Foata normal form. 376/30017 useless extension candidates. Maximal degree in co-relation 89224. Up to 12818 conditions per place. [2022-12-06 07:12:01,833 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 184 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2022-12-06 07:12:01,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 194 transitions, 1591 flow [2022-12-06 07:12:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-06 07:12:01,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2022-12-06 07:12:01,835 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 402 flow. Second operand 5 states and 108 transitions. [2022-12-06 07:12:01,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 194 transitions, 1591 flow [2022-12-06 07:12:02,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 194 transitions, 1591 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:12:02,034 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 465 flow [2022-12-06 07:12:02,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2022-12-06 07:12:02,034 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2022-12-06 07:12:02,034 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:02,034 INFO L89 Accepts]: Start accepts. Operand has 82 places, 71 transitions, 465 flow [2022-12-06 07:12:02,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:02,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:02,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 71 transitions, 465 flow [2022-12-06 07:12:02,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 71 transitions, 465 flow [2022-12-06 07:12:02,077 INFO L130 PetriNetUnfolder]: 452/808 cut-off events. [2022-12-06 07:12:02,077 INFO L131 PetriNetUnfolder]: For 1303/1650 co-relation queries the response was YES. [2022-12-06 07:12:02,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 808 events. 452/808 cut-off events. For 1303/1650 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3493 event pairs, 67 based on Foata normal form. 21/731 useless extension candidates. Maximal degree in co-relation 2679. Up to 492 conditions per place. [2022-12-06 07:12:02,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 71 transitions, 465 flow [2022-12-06 07:12:02,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 1820 [2022-12-06 07:12:02,090 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:02,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 07:12:02,091 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 465 flow [2022-12-06 07:12:02,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:02,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:02,091 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:02,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:12:02,091 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 4 more)] === [2022-12-06 07:12:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:02,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1571483643, now seen corresponding path program 2 times [2022-12-06 07:12:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499343092] [2022-12-06 07:12:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:02,223 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 07:12:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:02,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499343092] [2022-12-06 07:12:02,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499343092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:02,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:02,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:12:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709024916] [2022-12-06 07:12:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:02,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:12:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:12:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:12:02,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:12:02,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:02,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:02,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:12:02,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:04,604 INFO L130 PetriNetUnfolder]: 27453/33785 cut-off events. [2022-12-06 07:12:04,604 INFO L131 PetriNetUnfolder]: For 105497/105497 co-relation queries the response was YES. [2022-12-06 07:12:04,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155104 conditions, 33785 events. 27453/33785 cut-off events. For 105497/105497 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 135511 event pairs, 4471 based on Foata normal form. 736/34521 useless extension candidates. Maximal degree in co-relation 106141. Up to 19825 conditions per place. [2022-12-06 07:12:04,817 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 177 selfloop transitions, 10 changer transitions 0/187 dead transitions. [2022-12-06 07:12:04,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 187 transitions, 1566 flow [2022-12-06 07:12:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-06 07:12:04,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5621621621621622 [2022-12-06 07:12:04,819 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 465 flow. Second operand 5 states and 104 transitions. [2022-12-06 07:12:04,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 187 transitions, 1566 flow [2022-12-06 07:12:05,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 187 transitions, 1551 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:12:05,286 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 504 flow [2022-12-06 07:12:05,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2022-12-06 07:12:05,287 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 37 predicate places. [2022-12-06 07:12:05,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:05,287 INFO L89 Accepts]: Start accepts. Operand has 87 places, 74 transitions, 504 flow [2022-12-06 07:12:05,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:05,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:05,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 74 transitions, 504 flow [2022-12-06 07:12:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 74 transitions, 504 flow [2022-12-06 07:12:05,342 INFO L130 PetriNetUnfolder]: 643/1103 cut-off events. [2022-12-06 07:12:05,342 INFO L131 PetriNetUnfolder]: For 2092/2507 co-relation queries the response was YES. [2022-12-06 07:12:05,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 1103 events. 643/1103 cut-off events. For 2092/2507 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5010 event pairs, 100 based on Foata normal form. 29/1013 useless extension candidates. Maximal degree in co-relation 3928. Up to 692 conditions per place. [2022-12-06 07:12:05,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 74 transitions, 504 flow [2022-12-06 07:12:05,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 1982 [2022-12-06 07:12:05,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 07:12:05,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:12:05,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 07:12:05,414 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 514 flow [2022-12-06 07:12:05,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:05,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:05,414 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:05,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:12:05,414 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 4 more)] === [2022-12-06 07:12:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2042265612, now seen corresponding path program 2 times [2022-12-06 07:12:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:05,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440415624] [2022-12-06 07:12:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:05,532 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 07:12:05,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440415624] [2022-12-06 07:12:05,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440415624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:05,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:05,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:12:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268166209] [2022-12-06 07:12:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:05,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:12:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:12:05,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:12:05,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:12:05,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 514 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:05,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:05,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:12:05,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:07,427 INFO L130 PetriNetUnfolder]: 24413/29993 cut-off events. [2022-12-06 07:12:07,427 INFO L131 PetriNetUnfolder]: For 97517/97517 co-relation queries the response was YES. [2022-12-06 07:12:07,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145367 conditions, 29993 events. 24413/29993 cut-off events. For 97517/97517 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 119188 event pairs, 1391 based on Foata normal form. 368/30361 useless extension candidates. Maximal degree in co-relation 112049. Up to 13182 conditions per place. [2022-12-06 07:12:07,614 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 184 selfloop transitions, 9 changer transitions 1/194 dead transitions. [2022-12-06 07:12:07,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 194 transitions, 1655 flow [2022-12-06 07:12:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-06 07:12:07,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2022-12-06 07:12:07,615 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 514 flow. Second operand 5 states and 108 transitions. [2022-12-06 07:12:07,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 194 transitions, 1655 flow [2022-12-06 07:12:08,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 194 transitions, 1625 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 07:12:08,232 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 491 flow [2022-12-06 07:12:08,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2022-12-06 07:12:08,233 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2022-12-06 07:12:08,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:08,233 INFO L89 Accepts]: Start accepts. Operand has 90 places, 72 transitions, 491 flow [2022-12-06 07:12:08,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:08,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:08,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 72 transitions, 491 flow [2022-12-06 07:12:08,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 72 transitions, 491 flow [2022-12-06 07:12:08,292 INFO L130 PetriNetUnfolder]: 575/961 cut-off events. [2022-12-06 07:12:08,292 INFO L131 PetriNetUnfolder]: For 1968/2378 co-relation queries the response was YES. [2022-12-06 07:12:08,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 961 events. 575/961 cut-off events. For 1968/2378 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4004 event pairs, 91 based on Foata normal form. 26/892 useless extension candidates. Maximal degree in co-relation 3461. Up to 617 conditions per place. [2022-12-06 07:12:08,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 72 transitions, 491 flow [2022-12-06 07:12:08,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 1902 [2022-12-06 07:12:08,312 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:08,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 07:12:08,313 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 491 flow [2022-12-06 07:12:08,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:08,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:08,313 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:08,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:12:08,313 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 4 more)] === [2022-12-06 07:12:08,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1879020941, now seen corresponding path program 1 times [2022-12-06 07:12:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:08,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303174735] [2022-12-06 07:12:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:08,809 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 07:12:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:08,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303174735] [2022-12-06 07:12:08,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303174735] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:08,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749506359] [2022-12-06 07:12:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:08,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:12:08,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:12:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:09,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:12:09,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:15,015 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 07:12:15,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:12:18,841 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 07:12:18,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749506359] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:12:18,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:12:18,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:12:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644809338] [2022-12-06 07:12:18,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:12:18,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:12:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:12:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=102, Unknown=2, NotChecked=0, Total=156 [2022-12-06 07:12:18,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:12:18,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 491 flow. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:18,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:18,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:12:18,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:21,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:26,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:29,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:46,289 INFO L130 PetriNetUnfolder]: 34527/42681 cut-off events. [2022-12-06 07:12:46,289 INFO L131 PetriNetUnfolder]: For 144409/144409 co-relation queries the response was YES. [2022-12-06 07:12:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206186 conditions, 42681 events. 34527/42681 cut-off events. For 144409/144409 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 179805 event pairs, 5285 based on Foata normal form. 66/42747 useless extension candidates. Maximal degree in co-relation 159075. Up to 31119 conditions per place. [2022-12-06 07:12:46,601 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 323 selfloop transitions, 114 changer transitions 12/449 dead transitions. [2022-12-06 07:12:46,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 449 transitions, 3601 flow [2022-12-06 07:12:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:12:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:12:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 308 transitions. [2022-12-06 07:12:46,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6234817813765182 [2022-12-06 07:12:46,618 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 491 flow. Second operand 13 states and 308 transitions. [2022-12-06 07:12:46,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 449 transitions, 3601 flow [2022-12-06 07:12:47,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 449 transitions, 3556 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 07:12:47,452 INFO L231 Difference]: Finished difference. Result has 106 places, 180 transitions, 1797 flow [2022-12-06 07:12:47,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1797, PETRI_PLACES=106, PETRI_TRANSITIONS=180} [2022-12-06 07:12:47,453 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2022-12-06 07:12:47,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:47,453 INFO L89 Accepts]: Start accepts. Operand has 106 places, 180 transitions, 1797 flow [2022-12-06 07:12:47,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:47,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:47,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 180 transitions, 1797 flow [2022-12-06 07:12:47,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 180 transitions, 1797 flow [2022-12-06 07:12:47,537 INFO L130 PetriNetUnfolder]: 798/1350 cut-off events. [2022-12-06 07:12:47,537 INFO L131 PetriNetUnfolder]: For 3995/4727 co-relation queries the response was YES. [2022-12-06 07:12:47,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6438 conditions, 1350 events. 798/1350 cut-off events. For 3995/4727 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6179 event pairs, 89 based on Foata normal form. 51/1290 useless extension candidates. Maximal degree in co-relation 6280. Up to 861 conditions per place. [2022-12-06 07:12:47,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 180 transitions, 1797 flow [2022-12-06 07:12:47,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 4412 [2022-12-06 07:12:47,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 07:12:47,604 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:12:47,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:12:47,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:12:47,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:12:47,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:12:47,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:12:47,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:12:47,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:12:47,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:12:47,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:12:48,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:12:48,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:12:48,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] L78-1-->thread6EXIT: Formula: (and (not (< (mod v_~x6~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x6~0=v_~x6~0_In_5} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_5, ~n~0=v_~n~0_In_1} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 07:12:48,243 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:12:48,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 791 [2022-12-06 07:12:48,244 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 180 transitions, 1954 flow [2022-12-06 07:12:48,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:48,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:48,244 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:48,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:12:48,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:48,449 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 4 more)] === [2022-12-06 07:12:48,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash 889327381, now seen corresponding path program 2 times [2022-12-06 07:12:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:48,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395727492] [2022-12-06 07:12:48,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395727492] [2022-12-06 07:12:48,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395727492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129005001] [2022-12-06 07:12:48,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:12:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:48,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:12:48,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:12:48,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:12:48,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:12:48,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:12:48,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:48,823 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 07:12:48,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:12:48,870 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 07:12:48,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129005001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:12:48,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:12:48,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:12:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129422960] [2022-12-06 07:12:48,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:12:48,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:12:48,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:48,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:12:48,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:12:48,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 07:12:48,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 180 transitions, 1954 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:48,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:48,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 07:12:48,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:52,705 INFO L130 PetriNetUnfolder]: 38625/47581 cut-off events. [2022-12-06 07:12:52,706 INFO L131 PetriNetUnfolder]: For 233872/233872 co-relation queries the response was YES. [2022-12-06 07:12:52,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261192 conditions, 47581 events. 38625/47581 cut-off events. For 233872/233872 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 203194 event pairs, 9305 based on Foata normal form. 1060/48641 useless extension candidates. Maximal degree in co-relation 248457. Up to 21396 conditions per place. [2022-12-06 07:12:53,234 INFO L137 encePairwiseOnDemand]: 46/54 looper letters, 321 selfloop transitions, 34 changer transitions 1/356 dead transitions. [2022-12-06 07:12:53,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 356 transitions, 4173 flow [2022-12-06 07:12:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2022-12-06 07:12:53,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-06 07:12:53,247 INFO L175 Difference]: Start difference. First operand has 106 places, 180 transitions, 1954 flow. Second operand 5 states and 130 transitions. [2022-12-06 07:12:53,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 356 transitions, 4173 flow [2022-12-06 07:12:54,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 356 transitions, 4001 flow, removed 79 selfloop flow, removed 1 redundant places. [2022-12-06 07:12:54,093 INFO L231 Difference]: Finished difference. Result has 111 places, 188 transitions, 2006 flow [2022-12-06 07:12:54,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2006, PETRI_PLACES=111, PETRI_TRANSITIONS=188} [2022-12-06 07:12:54,094 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2022-12-06 07:12:54,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:54,094 INFO L89 Accepts]: Start accepts. Operand has 111 places, 188 transitions, 2006 flow [2022-12-06 07:12:54,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:54,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:54,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 188 transitions, 2006 flow [2022-12-06 07:12:54,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 188 transitions, 2006 flow [2022-12-06 07:12:54,272 INFO L130 PetriNetUnfolder]: 1111/1839 cut-off events. [2022-12-06 07:12:54,273 INFO L131 PetriNetUnfolder]: For 6946/9846 co-relation queries the response was YES. [2022-12-06 07:12:54,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8861 conditions, 1839 events. 1111/1839 cut-off events. For 6946/9846 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9105 event pairs, 87 based on Foata normal form. 69/1801 useless extension candidates. Maximal degree in co-relation 8445. Up to 1114 conditions per place. [2022-12-06 07:12:54,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 188 transitions, 2006 flow [2022-12-06 07:12:54,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 4606 [2022-12-06 07:12:54,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:12:54,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:12:54,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:12:54,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [554] L78-1-->L54-1: Formula: (let ((.cse0 (mod v_~n~0_87 4294967296))) (and (< (mod v_~x3~0_69 4294967296) .cse0) (= 0 |v_thread6Thread1of1ForFork1_#res.offset_23|) (= (* v_~x3~0_69 2) v_~x3~0_68) (not (< (mod v_~x6~0_93 4294967296) .cse0)) (= |v_thread6Thread1of1ForFork1_#res.base_23| 0))) InVars {~x3~0=v_~x3~0_69, ~x6~0=v_~x6~0_93, ~n~0=v_~n~0_87} OutVars{~x3~0=v_~x3~0_68, thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_23|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_23|, ~x6~0=v_~x6~0_93, ~n~0=v_~n~0_87} AuxVars[] AssignedVars[~x3~0, thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] [2022-12-06 07:12:54,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:12:54,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 417 [2022-12-06 07:12:54,511 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 188 transitions, 2050 flow [2022-12-06 07:12:54,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:54,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:54,511 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:54,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:12:54,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 07:12:54,712 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 4 more)] === [2022-12-06 07:12:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1661654092, now seen corresponding path program 2 times [2022-12-06 07:12:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:54,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214773051] [2022-12-06 07:12:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:54,809 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 07:12:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:54,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214773051] [2022-12-06 07:12:54,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214773051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:54,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:54,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:12:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120203200] [2022-12-06 07:12:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:54,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:12:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:12:54,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:12:54,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:12:54,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 188 transitions, 2050 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:54,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:54,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:12:54,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:58,719 INFO L130 PetriNetUnfolder]: 40999/50300 cut-off events. [2022-12-06 07:12:58,720 INFO L131 PetriNetUnfolder]: For 303202/303202 co-relation queries the response was YES. [2022-12-06 07:12:59,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286809 conditions, 50300 events. 40999/50300 cut-off events. For 303202/303202 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 211029 event pairs, 12287 based on Foata normal form. 916/51216 useless extension candidates. Maximal degree in co-relation 283697. Up to 22649 conditions per place. [2022-12-06 07:12:59,191 INFO L137 encePairwiseOnDemand]: 50/58 looper letters, 350 selfloop transitions, 40 changer transitions 4/394 dead transitions. [2022-12-06 07:12:59,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 394 transitions, 4747 flow [2022-12-06 07:12:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2022-12-06 07:12:59,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4862068965517241 [2022-12-06 07:12:59,192 INFO L175 Difference]: Start difference. First operand has 110 places, 188 transitions, 2050 flow. Second operand 5 states and 141 transitions. [2022-12-06 07:12:59,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 394 transitions, 4747 flow [2022-12-06 07:13:00,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 394 transitions, 4574 flow, removed 57 selfloop flow, removed 1 redundant places. [2022-12-06 07:13:00,497 INFO L231 Difference]: Finished difference. Result has 115 places, 199 transitions, 2221 flow [2022-12-06 07:13:00,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1965, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2221, PETRI_PLACES=115, PETRI_TRANSITIONS=199} [2022-12-06 07:13:00,498 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 65 predicate places. [2022-12-06 07:13:00,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:00,498 INFO L89 Accepts]: Start accepts. Operand has 115 places, 199 transitions, 2221 flow [2022-12-06 07:13:00,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:00,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:00,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 199 transitions, 2221 flow [2022-12-06 07:13:00,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 199 transitions, 2221 flow [2022-12-06 07:13:00,665 INFO L130 PetriNetUnfolder]: 1500/2250 cut-off events. [2022-12-06 07:13:00,665 INFO L131 PetriNetUnfolder]: For 9458/14048 co-relation queries the response was YES. [2022-12-06 07:13:00,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11748 conditions, 2250 events. 1500/2250 cut-off events. For 9458/14048 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10001 event pairs, 115 based on Foata normal form. 18/2159 useless extension candidates. Maximal degree in co-relation 11602. Up to 1510 conditions per place. [2022-12-06 07:13:00,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 199 transitions, 2221 flow [2022-12-06 07:13:00,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 4656 [2022-12-06 07:13:00,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:13:00,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:13:00,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [557] L78-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_93 4294967296))) (and (= (* v_~x1~0_73 2) v_~x1~0_72) (= |v_thread6Thread1of1ForFork1_#res.base_29| 0) (not (< (mod v_~x6~0_99 4294967296) .cse0)) (< (mod v_~x1~0_73 4294967296) .cse0) (= 0 |v_thread6Thread1of1ForFork1_#res.offset_29|))) InVars {~x6~0=v_~x6~0_99, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_73} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_29|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_29|, ~x6~0=v_~x6~0_99, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_72} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset, ~x1~0] [2022-12-06 07:13:00,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:13:00,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:13:00,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:13:01,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork4_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_9 4294967296))) (= |v_thread2Thread1of1ForFork4_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, ~x2~0=v_~x2~0_In_5} OutVars{~x2~0=v_~x2~0_In_5, thread2Thread1of1ForFork4_#res.base=|v_thread2Thread1of1ForFork4_#res.base_Out_4|, thread2Thread1of1ForFork4_#res.offset=|v_thread2Thread1of1ForFork4_#res.offset_Out_4|, ~n~0=v_~n~0_In_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_#res.base, thread2Thread1of1ForFork4_#res.offset] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:13:01,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:13:01,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-06 07:13:01,051 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 199 transitions, 2298 flow [2022-12-06 07:13:01,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:01,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:01,051 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:01,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:13:01,052 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 4 more)] === [2022-12-06 07:13:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2000661149, now seen corresponding path program 1 times [2022-12-06 07:13:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:01,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996945933] [2022-12-06 07:13:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:01,459 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 07:13:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996945933] [2022-12-06 07:13:01,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996945933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:13:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641261098] [2022-12-06 07:13:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:01,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:01,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:13:01,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:13:01,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:13:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:01,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:13:01,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:13:12,848 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 07:13:12,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:13:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:13:15,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641261098] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:13:15,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:13:15,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:13:15,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616390894] [2022-12-06 07:13:15,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:13:15,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:13:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:13:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=102, Unknown=3, NotChecked=0, Total=156 [2022-12-06 07:13:15,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:13:15,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 199 transitions, 2298 flow. Second operand has 13 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:15,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:15,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:13:15,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:22,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:27,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:29,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:32,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:39,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:43,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:46,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:51,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:53,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:00,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:02,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:06,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:08,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:18,948 INFO L130 PetriNetUnfolder]: 59713/73881 cut-off events. [2022-12-06 07:14:18,948 INFO L131 PetriNetUnfolder]: For 385361/385361 co-relation queries the response was YES. [2022-12-06 07:14:19,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420600 conditions, 73881 events. 59713/73881 cut-off events. For 385361/385361 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 340421 event pairs, 4803 based on Foata normal form. 152/74033 useless extension candidates. Maximal degree in co-relation 408277. Up to 52905 conditions per place. [2022-12-06 07:14:19,851 INFO L137 encePairwiseOnDemand]: 45/65 looper letters, 521 selfloop transitions, 173 changer transitions 18/712 dead transitions. [2022-12-06 07:14:19,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 712 transitions, 7391 flow [2022-12-06 07:14:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:14:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:14:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 430 transitions. [2022-12-06 07:14:19,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41346153846153844 [2022-12-06 07:14:19,853 INFO L175 Difference]: Start difference. First operand has 114 places, 199 transitions, 2298 flow. Second operand 16 states and 430 transitions. [2022-12-06 07:14:19,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 712 transitions, 7391 flow [2022-12-06 07:14:22,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 712 transitions, 7170 flow, removed 84 selfloop flow, removed 2 redundant places. [2022-12-06 07:14:22,551 INFO L231 Difference]: Finished difference. Result has 137 places, 350 transitions, 4399 flow [2022-12-06 07:14:22,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4399, PETRI_PLACES=137, PETRI_TRANSITIONS=350} [2022-12-06 07:14:22,551 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 87 predicate places. [2022-12-06 07:14:22,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:14:22,551 INFO L89 Accepts]: Start accepts. Operand has 137 places, 350 transitions, 4399 flow [2022-12-06 07:14:22,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:14:22,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:14:22,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 350 transitions, 4399 flow [2022-12-06 07:14:22,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 350 transitions, 4399 flow [2022-12-06 07:14:22,862 INFO L130 PetriNetUnfolder]: 2115/3222 cut-off events. [2022-12-06 07:14:22,862 INFO L131 PetriNetUnfolder]: For 21625/34873 co-relation queries the response was YES. [2022-12-06 07:14:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19420 conditions, 3222 events. 2115/3222 cut-off events. For 21625/34873 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15354 event pairs, 120 based on Foata normal form. 29/3120 useless extension candidates. Maximal degree in co-relation 18994. Up to 2197 conditions per place. [2022-12-06 07:14:22,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 350 transitions, 4399 flow [2022-12-06 07:14:22,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 8468 [2022-12-06 07:14:22,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:14:22,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:14:23,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:14:23,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:14:23,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:14:23,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_5 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x4~0=v_~x4~0_In_5} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_5, ~n~0=v_~n~0_In_7, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:14:23,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:14:23,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] and [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] [2022-12-06 07:14:23,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] and [477] L54-1-->L54-1: Formula: (and (= (* v_~x3~0_20 2) v_~x3~0_19) (< (mod v_~x3~0_20 4294967296) (mod v_~n~0_27 4294967296))) InVars {~x3~0=v_~x3~0_20, ~n~0=v_~n~0_27} OutVars{~x3~0=v_~x3~0_19, ~n~0=v_~n~0_27} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:14:23,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:14:23,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_30 4294967296) (mod v_~n~0_37 4294967296)) (= v_~x4~0_29 (* v_~x4~0_30 2))) InVars {~x4~0=v_~x4~0_30, ~n~0=v_~n~0_37} OutVars{~x4~0=v_~x4~0_29, ~n~0=v_~n~0_37} AuxVars[] AssignedVars[~x4~0] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 07:14:23,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-1-->thread5EXIT: Formula: (and (not (< (mod v_~x5~0_In_5 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread5Thread1of1ForFork5_#res.offset_Out_4| 0) (= |v_thread5Thread1of1ForFork5_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_3, ~x5~0=v_~x5~0_In_5} OutVars{~x5~0=v_~x5~0_In_5, thread5Thread1of1ForFork5_#res.offset=|v_thread5Thread1of1ForFork5_#res.offset_Out_4|, ~n~0=v_~n~0_In_3, thread5Thread1of1ForFork5_#res.base=|v_thread5Thread1of1ForFork5_#res.base_Out_4|} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_#res.offset, thread5Thread1of1ForFork5_#res.base] and [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] [2022-12-06 07:14:23,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L62-1-->L54-1: Formula: (let ((.cse0 (mod v_~n~0_139 4294967296))) (and (= |v_thread4Thread1of1ForFork3_#res.offset_45| 0) (< (mod v_~x4~0_103 4294967296) .cse0) (= |v_thread4Thread1of1ForFork3_#res.base_45| 0) (= v_~x4~0_102 (* v_~x4~0_103 2)) (not (< (mod v_~x4~0_102 4294967296) .cse0)) (= v_~x3~0_94 (* v_~x3~0_95 2)) (< (mod v_~x3~0_95 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_95, ~x4~0=v_~x4~0_103, ~n~0=v_~n~0_139} OutVars{~x3~0=v_~x3~0_94, thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_45|, ~x4~0=v_~x4~0_102, ~n~0=v_~n~0_139, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_45|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork3_#res.offset, ~x4~0, thread4Thread1of1ForFork3_#res.base] and [474] L46-1-->L46-1: Formula: (and (= v_~x2~0_19 (* v_~x2~0_20 2)) (< (mod v_~x2~0_20 4294967296) (mod v_~n~0_23 4294967296))) InVars {~x2~0=v_~x2~0_20, ~n~0=v_~n~0_23} OutVars{~x2~0=v_~x2~0_19, ~n~0=v_~n~0_23} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:14:23,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L62-1-->L54-1: Formula: (let ((.cse0 (mod v_~n~0_139 4294967296))) (and (= |v_thread4Thread1of1ForFork3_#res.offset_45| 0) (< (mod v_~x4~0_103 4294967296) .cse0) (= |v_thread4Thread1of1ForFork3_#res.base_45| 0) (= v_~x4~0_102 (* v_~x4~0_103 2)) (not (< (mod v_~x4~0_102 4294967296) .cse0)) (= v_~x3~0_94 (* v_~x3~0_95 2)) (< (mod v_~x3~0_95 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_95, ~x4~0=v_~x4~0_103, ~n~0=v_~n~0_139} OutVars{~x3~0=v_~x3~0_94, thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_45|, ~x4~0=v_~x4~0_102, ~n~0=v_~n~0_139, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_45|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork3_#res.offset, ~x4~0, thread4Thread1of1ForFork3_#res.base] and [510] L70-1-->L70-1: Formula: (and (= (* v_~x5~0_32 2) v_~x5~0_31) (< (mod v_~x5~0_32 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x5~0=v_~x5~0_32, ~n~0=v_~n~0_41} OutVars{~x5~0=v_~x5~0_31, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x5~0] [2022-12-06 07:14:23,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L62-1-->L54-1: Formula: (let ((.cse0 (mod v_~n~0_139 4294967296))) (and (= |v_thread4Thread1of1ForFork3_#res.offset_45| 0) (< (mod v_~x4~0_103 4294967296) .cse0) (= |v_thread4Thread1of1ForFork3_#res.base_45| 0) (= v_~x4~0_102 (* v_~x4~0_103 2)) (not (< (mod v_~x4~0_102 4294967296) .cse0)) (= v_~x3~0_94 (* v_~x3~0_95 2)) (< (mod v_~x3~0_95 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_95, ~x4~0=v_~x4~0_103, ~n~0=v_~n~0_139} OutVars{~x3~0=v_~x3~0_94, thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_45|, ~x4~0=v_~x4~0_102, ~n~0=v_~n~0_139, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_45|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork3_#res.offset, ~x4~0, thread4Thread1of1ForFork3_#res.base] and [537] L38-1-->L38-1: Formula: (and (= v_~x1~0_63 (* v_~x1~0_64 2)) (< (mod v_~x1~0_64 4294967296) (mod v_~n~0_69 4294967296))) InVars {~n~0=v_~n~0_69, ~x1~0=v_~x1~0_64} OutVars{~n~0=v_~n~0_69, ~x1~0=v_~x1~0_63} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:14:23,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L62-1-->L54-1: Formula: (let ((.cse0 (mod v_~n~0_139 4294967296))) (and (= |v_thread4Thread1of1ForFork3_#res.offset_45| 0) (< (mod v_~x4~0_103 4294967296) .cse0) (= |v_thread4Thread1of1ForFork3_#res.base_45| 0) (= v_~x4~0_102 (* v_~x4~0_103 2)) (not (< (mod v_~x4~0_102 4294967296) .cse0)) (= v_~x3~0_94 (* v_~x3~0_95 2)) (< (mod v_~x3~0_95 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_95, ~x4~0=v_~x4~0_103, ~n~0=v_~n~0_139} OutVars{~x3~0=v_~x3~0_94, thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_45|, ~x4~0=v_~x4~0_102, ~n~0=v_~n~0_139, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_45|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork3_#res.offset, ~x4~0, thread4Thread1of1ForFork3_#res.base] and [511] L78-1-->L78-1: Formula: (and (= (* v_~x6~0_24 2) v_~x6~0_23) (< (mod v_~x6~0_24 4294967296) (mod v_~n~0_43 4294967296))) InVars {~x6~0=v_~x6~0_24, ~n~0=v_~n~0_43} OutVars{~x6~0=v_~x6~0_23, ~n~0=v_~n~0_43} AuxVars[] AssignedVars[~x6~0] [2022-12-06 07:14:24,354 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:14:24,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1804 [2022-12-06 07:14:24,355 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 349 transitions, 4627 flow [2022-12-06 07:14:24,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:14:24,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:14:24,355 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:14:24,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 07:14:24,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 07:14:24,556 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 4 more)] === [2022-12-06 07:14:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:14:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash -354648800, now seen corresponding path program 1 times [2022-12-06 07:14:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:14:24,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134967052] [2022-12-06 07:14:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:14:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:25,425 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 07:14:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:14:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134967052] [2022-12-06 07:14:25,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134967052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:14:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016250949] [2022-12-06 07:14:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:14:25,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:14:25,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:14:25,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:14:25,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:14:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:14:26,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 07:14:26,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2022-12-06 07:26:07,316 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:26:07,329 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:26:08,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 07:26:08,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown